우투리와툴툴

붕어빵https://www.acmicpc.net/problem/11052 123456789101112131415161718192021222324#include int boong[1001];int boo[1001];int main(void){ int N; scanf("%d", &N); for (int i = 1; i

2xn 타일링 2https://www.acmicpc.net/problem/11727 1234567891011121314151617#include int main(void){ int Dp[1010] = {}; int n; Dp[0] = 1; Dp[1] = 1; scanf("%d", &n); for (int i = 2; i

2xn 타일링https://www.acmicpc.net/problem/11726 12345678910111213141516#include int main(void){ int Dp[1010] = {}; int n; Dp[0] = 1; Dp[1] = 1; scanf("%d", &n); for (int i = 2; i

1로 만들기https://www.acmicpc.net/problem/1463 123456789101112131415161718192021222324252627#include int Dp[1000001]; int min(int a, int b){ return a > b ? b : a;} int main(void){ int N; scanf("%d", &N); Dp[1] = 0; for (int i = 2; i

타일 채우기https://www.acmicpc.net/problem/2133 12345678910111213141516171819202122232425#include int main(void){ int Dp[31] = {}; int result[31] = {}; int K; Dp[0] = 1; result[0] = 1; Dp[2] = 3; for (int i = 4; i

내리막길https://www.acmicpc.net/problem/1520 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include int map[510][510] = {};int visit[510][510] = {};int M, N; struct saveMap{ int x; int y;}; saveMap make_saveMap(int x, int y){ saveMap temp; temp.x = x; temp.y = y; return temp;} int serch(int x, int y){ int vect_x[5] = { 0, 1, 0, -1, 0 }; int vect_y[5] ..

스티커 https://www.acmicpc.net/problem/946512345678910111213141516171819202122232425262728293031323334353637#include int stiker[2][100010];int dp[2][100010]; int max(int a, int b){ return a > b ? a : b;}int main(void){ int testcase; scanf("%d", &testcase); while (testcase--){ int n; scanf("%d", &n); for (int i = 0; i

01knapsackhttp://59.23.113.171/30stair/01knapsack/01knapsack.php?pname=01knapsack1234567891011121314151617181920212223242526272829303132333435363738#include int Dp[101][10010] = {}; struct jjj{ int weight; int value;}; int main(void){ int N; int jNum; jjj jew[110] = {}; scanf("%d", &N); scanf("%d", &jNum); for (int i = 0; i

자두나무https://www.acmicpc.net/problem/22401234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include int max(int a, int b){ return a > b ? a : b;} int main(void){ int T, W; int Dp[2][1010][33] = {}; int jado[1010] = {}; int maxResult = 0; scanf("%d %d", &T, &W); for (int i = 1; i

1,2,3 더하기https://www.acmicpc.net/problem/90951234567891011121314151617181920212223242526#include int main(void){ int testcase; scanf("%d", &testcase); while (testcase--){ int Dp[15] = {}; Dp[0] = 1; int K; scanf("%d", &K); for (int i = 1; i =0) Dp[i] += Dp[i - 1]; if (i - 2 >= 0) Dp[i] += Dp[i - 2]; if (i - 3 >= 0) Dp[i] += Dp[i - 3]; } printf("%d\n", Dp[K]); } return 0;}cs 1. 이 문제 같은경우는 1,2,3 만..