히더

BOJ::15683::감시 출처 : https://www.acmicpc.net/problem/15683 #include using namespace std; int N, M, vs, a[8][8], ans,dy[] = { -1,0,1,0 }, dx[] = { 0,1,0,-1 }, nc[6] = { 0,1,2,2,3,4 }, cc[6][4] = { {},{0},{0,2},{0,1},{0,1,3},{0,1,2,3} };vector v; int cal(int vi, int res) {if (vi == vs) return res;int ta[8][8], tmp = 65; memcpy(ta, a, sizeof(a));auto tp = v[vi];for(int i=0;i= 0 && nx < M&&a[ny][nx] ..

출처 : https://www.acmicpc.net/problem/9466 #include #include #include using namespace std; int N, arr[100001], result;bool check[100001], e[100001]; void dfs(int now){check[now] = true;if (check[arr[now]]){if (!e[arr[now]]){for (int i = arr[now]; i != now; i = arr[i]) result++;result++;}}else dfs(arr[now]);e[now] = true;} int main(){int t = 1; int T;cin >> T;while (T--){result = 0; memset(arr, 0,..

출처 : https://www.acmicpc.net/problem/14890 #include using namespace std; int i, j;int N;int L;int arr[105][105];int arr2[105][105];int arr3[105][105];int result; void get_info(){cin >> N >> L;for (i = 0;i > arr[i][j];arr2[i][j] = 10;arr3[i][j] = 10;}} } void print_info(){cout 1 || arr2[i][j] < -1) // 1초과 -1 미만 경우{result--;} if (arr2[i][j] == 0) // 0인 경우{coun..

출처 : https://www.acmicpc.net/problem/14503 #include #include using namespace std; int N, M, K, result, direction, starti, startj;int map[50][50];bool visited[50][50];int dir[4][2] = { {0,-1},{1,0},{0,1},{-1,0} };bool finished; void cal(int i, int j, int d){if (finished) return; visited[i][j] = true; map[i][j] = 2; int startD; if (d == 0) startD = 0;else if (d == 1) startD = 3;else if (d == 2) st..

출처 : https://www.acmicpc.net/problem/14500 #include #include using namespace std; #define MAX_N 512 int N, M, result;int map[MAX_N][MAX_N];int cc[19][4][2] = {{ { 0,0 },{ 1,0 },{ 0,1 },{ 1,1 } },{ { 0,0 },{ 0,1 },{ 0,2 },{ 0,3 } },{ { 0,0 },{ 1,0 },{ 2,0 },{ 3,0 } },{ { 0,0 },{ 1,0 },{ 1,1 },{ 2,1 } },{ { 0,0 },{ 0,1 },{ 1,1 },{ 1,2 } },{ { 1,0 },{ 1,1 },{ 0,1 },{ 0,2 } },{ { 0,1 },{ 1,1 },{ 1,0..

출처 : https://www.acmicpc.net/problem/13458 #include #include #include using namespace std; #define MAX_N 1000000 long N, B, C, result;long bang[MAX_N]; void cal(){for (long i = 0; i 0){result += bang[i] / C;if (bang[i] % C > 0) result += 1;}}} int main(){cin >> N; result = 0;for (long i = 0; i > bang[i];cin >> B >> C;cal();cout

출처 : https://www.acmicpc.net/problem/12100 #include #include #include using namespace std; int N, result;int map[20][20];bool check[20][20]; void move(int d, int (*a)[20]){memset(check, false, sizeof(check));if (d == 0){for(int j=0; j

출처 : https://www.acmicpc.net/problem/14501 #include #include using namespace std; int N, Result;int T[17], P[17], dp[17]; int main(){cin >> N;for (int i = 1; i > T[i]; cin >> P[i];}for (int i = 1; i

출처 : https://www.acmicpc.net/problem/1463 1. dp를 이용해 계산한다. #include #include using namespace std; #define MAX_N 1000001int i, N, result;int dp[MAX_N]; void input(){ cin >> N;} void cal(){ dp[1] = 0; dp[2] = 1; dp[3] = 1; for (i = 4;i

출처 : https://www.acmicpc.net/problem/11726 1. dp를 이용해 계산한다. #include #include using namespace std; #define MAX_N 1001#define mod 10007 int i, N, result;int dp[MAX_N]; void input(){ cin >> N;} void cal(){ dp[1] = 1; dp[2] = 2; for (i = 3;i