광그로

https://www.acmicpc.net/problem/11727 1234567891011121314151617#include using namespace std; int main(){ int dp[1001]; dp[1] = 1; dp[2] = 3; int n; cin >> n; for (int i = 3; i

https://www.acmicpc.net/problem/11726 12345678910111213141516171819202122#include #include #include using namespace std;int dp[1001]; //2xn 직사각형을 채우는 방법의 수 int function(int n) { if(!dp[n]) dp[n] = ( function(n-1) + function(n-2) ) % 10007; return dp[n];}int main(){ int n; cin >> n; memset(dp, 0, sizeof(dp)); dp[1] = 1; dp[2] = 2; function(n); cout

https://www.acmicpc.net/problem/1463 1234567891011121314151617181920212223242526#include #include #include using namespace std;#define INF 9999999 int dp[1000001]; : Memoization void divide(int x, int cnt) { if (dp[x] > t; memset(dp, INF, sizeof(dp)); divide(t, 0); cout