그랬었습니다

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include using namespace std;int mm = 0, zero = 0, pp = 0; int papers(int** arr, int x, int y, int size) { int val = arr[x][y]; bool one = true; for (int i = 0; i

123456789101112131415161718192021222324252627282930313233#include using namespace std; int main() { char que[51]; scanf("%s", que); int num = 0, val = 0, minus = 0; for (int i = 0; i

12345678910111213141516171819#include using namespace std; int main() { int n; cin >> n; int** arr = new int* [3]; for (int i = 0; i

12345678910111213141516171819202122232425262728#include #include #include #include using namespace std; int main() { int T; scanf("%d", &T); for (int i = 0; i clothes >> category; if (_map.find(category) == _map.end()) _map[category] = 1; else _map[category]++; } for (map::iterator iter = _map.begin(); iter != _map.end(); iter++) { sets *= iter->second + 1; } printf("%d\n", sets - 1); }}Colored ..

123456789101112131415161718192021222324252627282930313233#include #include #include using namespace std; int main() { int T; scanf("%d", &T); for (int i = 0; i

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include #include using namespace std; int main() { int M, N, max = 1, num = 0; scanf("%d %d", &M, &N); int** field = new int* [N]; queue bfs; for (int i = 0; i

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 #include #include using namespace std; int main() { int N, K; cin >> N >> K; if (N>K) { cout

1234567891011121314151617181920212223#include using namespace std; int main() { int N, r, c, x = 0, y = 0, index = 0; cin >> N >> r >> c; int num = 1; for (int i = 1; i 0) { if (r >= y + num) { y += num; index += num * num * 2; } if (c >= x + num) { x += num; index += num * num; } num /= 2; } cout

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include bool isOnField(int x, int y, int width, int height) { if (x = height) return false; return true;} void DFS(int** arr, int x, int y, int width, int height) { if (!isOnField(x, y, width, height) || arr[x][y] == 0) return; arr[x][y] = 0; DFS(arr, x, y - 1, width, height); DFS(arr, x - 1, y, wid..

123456789101112131415161718192021222324#include #include #include using namespace std; int main() { int N; scanf("%d", &N); int* arr = new int[N]; priority_queue pQueue; unordered_map uMap; for (int i = 0; i 0; pQueue.pop()) { if (uMap.find(pQueue.top()) == uMap.end()) { uMap.insert({ pQueue.top(), i }); i++; } } for (int i = 0; i second);}Colored by Color Scriptercs