2016/0452 [백준][1509번][DP] 팰린드롬 분할 팰린드롬 분할https://www.acmicpc.net/problem/1509 1234567891011121314151617181920212223242526272829303132333435363738394041#include #include using namespace std;int Dp[2501][2501];int result[2501];int main(void){ char room[2501]; string size; int roomSize; scanf("%s", room); size = room; roomSize = size.size(); for (int i = 1; i 2016. 4. 15. [백준][10942번][DP] 펠린드롬? 펠린드룸?https://www.acmicpc.net/problem/10942 123456789101112131415161718192021222324252627282930#include int Dp[2001][2001] = {};int main(void){ int N; int room[2001] = {}; scanf("%d", &N); for (int i = 1; i 2016. 4. 15. [백준][11048번][DP] 이동하기 이동하기https://www.acmicpc.net/problem/11048 1234567891011121314151617181920212223242526272829#include int candyMap[1001][1001];int Dp[1001][1001]; int max(int a, int b){ return a > b ? a : b;} int main(void){ int N, M; scanf("%d %d", &N, &M); for (int i = 1; i 2016. 4. 15. [백준][2011번][DP] 암호코드 암호코드https://www.acmicpc.net/problem/2011 12345678910111213141516171819202122232425262728293031#include #include using namespace std;#define mod 1000000int main(void){ char secret[5001]; int secretSize; int Dp[5010] = {}; Dp[0] = 1; Dp[1] = 1; string s; scanf("%s", secret); s = secret; secretSize = s.size(); for (int i = 2; i '0') Dp[i] = Dp[i - 1] % mod; int x = (secret[now- 1]-'0') * 10 + secre.. 2016. 4. 15. [벡준][2225번][DP] 합분해 합분해https://www.acmicpc.net/problem/2225 1234567891011121314151617181920212223242526#include #define mod 1000000000int main(void){ int N, K; int Dp[210][210] = {}; scanf("%d %d", &N, &K); for (int i = 0; i 2016. 4. 15. [백준][9461번][DP] 파도반 수열 파도반 수열https://www.acmicpc.net/problem/9461 123456789101112131415161718#include int main(void){ int testcase; long long Dp[101] = { 1, 1, 1, 1, 2, 2, }; scanf("%d",&testcase); for (int i = 6; i 2016. 4. 14. 이전 1 2 3 4 5 ··· 9 다음 728x90
