전체 글111 [백준][11057번][DP] 오르막 수 오르막수https://www.acmicpc.net/problem/11057 12345678910111213141516171819202122232425#include #define mod 10007 int main(void){ int N; int number[1001][10] = {}; int total = 0; scanf("%d", &N); for (int i = 0; i 2016. 4. 13. [백준][10844번][DP] 쉬운 계단 수 쉬운 계단 수https://www.acmicpc.net/problem/10844 1234567891011121314151617181920212223#include #define mod 1000000000int main(void){ int N; int Dp[101][10] = {}; int sum = 0; scanf("%d", &N); for (int i = 0; i 2016. 4. 13. [백준][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. 이전 1 ··· 5 6 7 8 9 10 11 ··· 19 다음 728x90
