Algorithm73 [백준][11052번][DP] 붕어빵 붕어빵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 2016. 4. 13. [백준][11727번][DP] 2xn 타일링 2 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 2016. 4. 12. [백준][11726번][DP] 2xn 타일링 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 2016. 4. 12. [백준][1463번][DP] 1로 만들기 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 2016. 4. 12. [백준][2133번][DP] 타일 채우기 타일 채우기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 2016. 4. 12. [백준][1520번][DP] 내리막길 내리막길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] .. 2016. 4. 12. 이전 1 ··· 3 4 5 6 7 8 9 ··· 13 다음 728x90
