123456789101112131415161718#include using namespace std;int sqr(int n, int m){ if(m>0) return n*sqr(n, m-1); else return 1;}int main(){ for(int T=1; T> i; int N, M; cin >> N >> M; cout
#include using namespace std; struct robot { int r; int c; int dir; }; int main() { int N, M; cin >> N >> M; bool map[50][50] = { 1 }; robot x; cin >> x.r >> x.c >> x.dir; int cnt = 0; for (int i = 0; i map[i][j]; while (1) { map[x.r][x.c] = 1; if (!(map[x.r][x.c - 1] & map[x.r][x.c + 1] & map[x.r - 1][x.c] & map[x.r + 1][x.c])) { if (x.dir == 0) { x.dir = 3; if (map[x.r][x.c - 1] == 0) { x.c = ..
#include using namespace std; int Answer; int main(int argc, char** argv) { int T, test_case; int N; cin >> T; for(test_case = 0; test_case > N; for(int i=0; i>x; Answer ^= x; } cout
#include #include using namespace std; bool G[102][102]; int find(int start, int end, int N) { bool visited[102] = { 0 }; queue q; q.push(start); int next; int now = q.front(); while (!q.empty()) { now = q.front(); q.pop(); for (int i = 1; i > N; input_G(N); for (int i = 1; i
