하하하하 웃어요

#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..