히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh #include #include #include using namespace std; int result, a, z;int arr[101]; int main(){int T; int t;cin >> T;while (T--){cin >> t; result = 0; memset(arr, 0, sizeof(arr)); int n = 1000; z = -1;while (n--){cin >> a;arr[a]++;if (result

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV139KOaABgCFAYh #include #include #include #include using namespace std; int result, D;vector v1; void cal(){result = (v1[0] - v1[99]);while (D--){if ((v1[0] - v1[99]) > 1){v1[0]--; v1[99]++;for (int i = 1; i= v1[i])) break; if ((v1[99] >= v1[i]) && (v1[i - 1] >= v1[99])){int tmp2 = v1[99];v1.pop_back();v1.ins..

출처 : 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.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV134DPqAA8CFAYh#none #include #include #include using namespace std; int N, arr[1000], result; int main(){int t = 1, T = 10;while (T--){result = 0; memset(arr, 0, sizeof(arr));cin >> N;for (int i = 0; i > arr[i];for (int i = 2; i < N - 2; i++){int tmp = arr[i] - max(max(arr[i - 2], arr[i - 1]), m..

출처 : 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