#include #include using namespace std;bool map[11][11];bool visited [11];int maxcnt; int N, M; void dfs(int root, int x){ visited[root]=1; if(maxcnt T; for(int i=1; i> N >> M; if(M == 0) { cout y; map[x][y]=1; map[y][x]=1; } maxcnt=0; for(int j=1; j
#include #include //bfsusing namespace std;int box[1002][1002];int ripen[1002][1002]; struct xy{ int x; int y;};int main(){ queue q; int M, N; cin >> M >> N; int cnt=0; int result=0; for(int i=0; i
#include using namespace std; int main(){ int T; cin >> T; for(int i=1; i> N; char farm[49]; int sum=0; int cnt=0; for(int j=0; j> farm; for(int k=0; k=(N/2-j) && k farm; for(int k=cnt; k
#include #include using namespace std; char map[251][251]; int M, N; void fill(int i, int j, char org_color, char color) { map[i][j] = color; if (i>1 && map[i - 1][j] == org_color) fill(i - 1, j, org_color, color); if (i1 && map[i][j - 1] == org_color) fill(i, j - 1, org_color, color); if (i> order; if (order == 'I') { cin >> M >> N; for (int i = 1; i Y >> C; map[Y][X] = C; } else if (order == '..
