히더

출처 : 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.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWRKNev6fqYDFAV8 #include #include #include using namespace std; int result, arr[26];string s; int main(){int T; cin >> T; int t = 1;while (T--){cin >> s; result = 0; memset(arr, 0, sizeof(arr));for (int i = 0; i < s.size();i++) arr[s.at(i) - 97]++;for (int i = 0; i < 26;i++)result += ((arr[i] * (arr[i] + 1)) /..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWS2h6AKBCoDFAVT #include #include #include using namespace std; long long L, R, N, result, flag;long long map[50000]; int main(){ long long T, t = 1; cin >> T; while (T--) { cin >> N; result = 0; flag = 0; memset(map, 0, sizeof(map)); for (long long i = 0; i > map[i]; L = 0; R = 0; for (long long..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWS2dSgKA8MDFAVT #include #include #include using namespace std; int np, p;string s; int main(){ int T, t = 1; cin >> T; while (T--) { np = 0; p = 0; cin >> s; for (int i = 0; i 0) && i > p) { np += (i - p); p += (i-p); } p +=(s[i]-48); } cout

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWSNnKiazq0DFAUr #include #include #include #include using namespace std; int N, result, sum, s1, s2, s3, flag, t;vector arr;vector v[2]; void cal(int count, int sss, int start){if (flag == 1) return;if (count == 3){cout