히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWIeW7FakkUDFAVH #include #include using namespace std; #define MAX_N 20 int i, j, N, X, K, cnt, result;int ga[MAX_N][MAX_N], se[MAX_N][MAX_N];bool visited[MAX_N][MAX_N], check; void input(){ int tmp; result = 0; cin >> N >> X; for (i = 0;i > tmp; ga[i][j] = tmp; se[j][i] =..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; int i, j, K, result;int a[4][8]; int ro[40][2]; int check[4][2]; void rotation(int i, int wh){ int tmp; if (wh == 1) { tmp = a[i][1]; a[i][1] = a[i][0]; for (j = 2;j = ..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWHPkqBqAEsDFAUn #include #include using namespace std; #define MAX_N 101#define MAX_M 10000 int i, j, N, result;int a[MAX_N], check[MAX_M]; void input(){ cin >> N; for (i = 1;i > a[i]; for (i = 0;i 0 && j+a[i]> T; while (T--) { input(); cal(); cout