소스코드123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354#include using namespace std; int caseA[8][8], caseB[8][8], m, n, map[51][51], Min=987654321; int cal(int x, int y) { int a = 0, b = 0; for (int i = x; i > m; for (int i = 0; i a; if (a == 'W') map[i][j] = 0; else map[i][j] = 1; } } for (int i = 0; i

소스코드123456789101112131415161718192021222324252627282930#include using namespace std; int main() { int n, k; long long l = 0, r, a[10001],range=0, Max = 0; cin >> k >> n; for (int i = 0; i > a[i]; if (range

소스코드12345678910111213141516#include using namespace std; int main() { int tc,num; cin >> tc; while (tc > 0) { cin >> num; for (int i = 0; i

소스코드123456789101112#include using namespace std; int main() { int l, p, a[5]; cin >> l >> p; for (int i = 0; i > a[i]; cout

소스코드12345678910111213141516171819202122232425262728293031323334353637#include #include using namespace std; int v[35][35],n; // pp[0]=동 pp[1]=서 pp[2]=남 pp[3]=북int dx[4] = { 0, 0, 1, -1 };int dy[4] = { 1, -1, 0, 0 };double result = 0, pp[4]; void dfs(int x, int y, int depth, double curPP) { v[x][y] = 1; if (depth == n) { v[x][y] = 0; result += curPP; return; } for (int i = 0; i > n; for (int i = ..

소스코드123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869#include using namespace std; int n, Max=0;char map[51][51]; void garo() { for (int i = 0; i