그랬었습니다

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

1234567891011121314151617181920212223#include int main() { int N, two = 0, five = 0; scanf("%d", &N); for (int i = 2; i five ? five : two);}Colored by Color Scriptercs

12345678910111213141516171819202122232425262728293031#include #include #include using namespace std; int main() { priority_queue p_queue; int N; scanf("%d", &N); for (int i = 0; i

12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include #include int main() { bool arr[21]{ true, }; int M; scanf("%d", &M); for (int i = 0; i

1234567891011121314151617181920212223242526272829303132#include using namespace std; void DFS(bool** connect, bool* arr, int size, int pos, int inf = 0) { for (int i = 1; i > T >> num; bool* arr = new bool[T + 1]{ false, }; bool** connect = new bool* [T + 1]; for (int i = 1; i com1 >> com2; connect[com1][com2] = true; connect[com2][com1] = true; } DFS(connect, arr, T, 1); for (int i = 1; i

1234567891011121314151617181920212223242526272829303132333435363738394041#include #include using namespace std; class Meeting {private: int start, end;public: bool operatorend == m1.end) return this->start end start = start; this->end = end; } int getEnd() { return end; } int getStart() { return start; }}; int main() { int N, cnt = 0, criterion = 0; cin >> N; Meeting* meetings = new Meeting[N]; ..

1234567891011121314151617#include using namespace std; int main() { int n; cin >> n; int** arr = new int*[n + 1]; for (int i = 1; i

123456789101112131415161718192021222324252627282930313233#include using namespace std; void find(int** grp, int* arr, int size, int val) { arr[val] = 1; for (int pos = 0; pos > N >> M; int* arr = new int[N + 1]{ 0, }; int** grp = new int*[N + 1]; for (int i = 1; i u >> v; grp[u][v] = 1; grp[v][u] = 1; } for (int i = 1; i