하하하하 웃어요

#include #include #include using namespace std; const long long int maximum = 1e17; // 17자리씩 담아야지~ typedef struct big{ // 17자리씩 담아야지~ long long int high = 0; long long int low = 0; }big; big operator+(big a, big b) { big c; c.high = a.high + b.high; if (a.low + b.low > maximum) { c.low = a.low + b.low - maximum; c.high++; } else { c.low = a.low + b.low; } return c; } big memo[101][101]; big rec(..

#include using namespace std; int pills[1000] {}; int numPills; long long catalanNum[31] {}; long long catalan(int num) { if (num < 2) { catalanNum[num] = 1; return 1; } if (num == 2) { catalanNum[num] = 2; return 2; } if (catalanNum[num] != 0) { return catalanNum[num]; } for (int i = 0; i < num; i++) { catalanNum[num] += catalan(i) * catalan(num - 1 - i); } return catalanNum[num]; } void solve(..

#include #include using namespace std; int N; int numbers[101] {}; long long memo[101][21]; long long equations(int depth, int num) { if (depth 20) { return 0; } if (depth == 1 && num == numbers[1]) { return 1; } if (memo[depth][num] != -1LL) { return memo[depth][num]; } memo[depth][num] = equations(depth - 1, num - numbers[depth]) + equations(depth - 1, num + numbers[dep..

#include #include using namespace std; typedef struct { int row; int column; } dot; int dr[] = {0, 0, -1, 1}; int dc[] = {1, -1, 0, 0}; int n, m; int graph[500][500] = {-1, }; bool check[500][500] = {false, }; int pictureNum; int picture[250 * 500] = {0, }; int bfs(dot start) { queue q; q.push(start); check[start.row][start.column] = true; int pictureSize = 1; while (!q.empty()) { dot next = q.f..

#include #include using namespace std; typedef struct { int A; int B; int C; } Bucket; int A, B, C; bool check[201][201] = {false, }; bool answer[201] = {false, }; void bfs(Bucket start) { queue q; q.push(start); while (!q.empty()) { Bucket next = q.front(); q.pop(); if (check[next.A][next.B]) { continue; } else { check[next.A][next.B] = true; } if (next.A == 0) { answer[next.C] = true; } // A -..

#include #include #include #include using namespace std; typedef struct { int m; int n; } dot; int m, n; // m: row, n: column int graph[50][50] = {0, }; bool check[50][50] = {false, }; // west, north, east, south int dm[] = {0, -1, 0, 1}; int dn[] = {-1, 0, 1, 0}; int roomNum; int room[2501] = {0, }; // room[roomNum] = roomSize int bfs(dot start) { queue q; q.push(start); check[start.m][start.n]..

#include using namespace std; int N; bool isPrimeNumber(int num) { if (num < 2) return false; for (int i = 2; i * i

#include #include using namespace std; vector graph[501]; bool visit[501] = {false, }; int bfs(int startV) { int numF = 0; visit[startV] = true; numF += graph[startV].size(); for (int i : graph[startV]) visit[i] = true; for (int i : graph[startV]) { for (int j : graph[i]) { if (visit[j] == false) { visit[j] = true; numF++; } } } return numF; } void input() { int numV, numE; int tmp1, tmp2; cin >..

#include using namespace std; bool space[29][29] = {false,}; double probability[4]; int directionX[4] = {1, -1, 0, 0}; int directionY[4] = {0, 0, -1, 1}; int moveCount; double dfs(int x, int y, int moveCount) { int nextX; int nextY; if (moveCount == 0) { return 1.0; } space[x][y] = true; double result = 0.0; for (int i = 0; i < 4; i++){ nextX = x + directionX[i]; nextY = y + directionY[i]; if (s..