소스코드12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576#include using namespace std; struct position { int x; int y; int cnt;}; int k, w, h, map[215][215],v[35][215][215],chk[215][215];int mdx[4] = { 0, 0, -1, 1 };int mdy[4] = { -1, 1, 0, 0 };int hdx[8] = {-1,-2,-2,-1,1,2,2,1};int hdy[8] = {-2,-1,1,2,2,1,..

소스코드1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889#include using namespace std; int n, m, a[101][101];long long Max = 0; long long sum(int sx, int sy, int ex, int ey) { long long ret = 0; for (int i = sy; i n >> m; for (int i = 0; i tmp; a[i][j] = tmp-'0'; } } // 1번 case for..

소스코드12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970#include #include using namespace std; // 조건// 1. 모든 칸을 전부 방문 했는지// 2. 겹치는 칸이 있는지// 3. 나이트가 이동할 수 있는 경로로 이동했는지// A -> ASCii 65번, 0 -> 48번 int main() { int visit[7][7]; int a, b, preA, preB; int dx[8] = {-1,-2,-2,-1,1,2,2,1}; int dy[8] = {-2,-1,1,2,-2,-1,1,2}; cha..

소스코드123456789101112131415161718192021222324252627282930313233343536373839404142434445#include using namespace std; int f[12], p[12][12], Max=0; void mapping(int d, int sum) { if (d == 11) { if (Max tc; while (tc>0){ for (int i = 0; i p[i][j]; } f[i] = 0; } Max = 0; for (int i = 0; i

소스코드12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include using namespace std; int num[1001]; int chk(int origin, int number, int strike, int ball) { int n1 = number / 100, n2 = (number % 100) / 10, n3 = (number % 100) % 10; int o1 = origin / 100, o2 = (origin % 100) / 10, o3 = (origin % 100) % 10; int stCnt = 0; int bCnt = 0; if (o1 == 0 || o2 == 0 ||..

소스코드1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586#include using namespace std; char Rotate[4] = { 'N', 'E', 'S', 'W' };int dirX[4] = {1,0,-1,0};int dirY[4] = {0,1,0,-1}; struct robot{ int x; int y; int rot;};int a,b,n,m,map[102][102];robot rb[102]; void L(int id, int cnt) { int t..