전체 글412 9084 동전 123456789101112131415161718192021222324252627282930313233#include using namespace std; int main() { int t, n, m[21] = { 0 }; scanf("%d", &t); getchar(); for (int i = 0; i 2019. 2. 11. 돌다리건너기 더블릿 (2602 백준) 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647#include #include using namespace std; int dp[1000][3][1000] = { 0 };char a[1000] = { 0 };char b[3][1000] = { 0 }; int main() { scanf("%s %s %s", &a,&b[1],&b[2]); getchar(); int sn = strlen(a); int bn = strlen(b[1]); for (int k = 0; k 2019. 2. 10. 부분합 더블릿 1234567891011121314151617181920212223242526272829#include long long dp[1000] = { 0 }; int main() { int n; scanf("%d", &n); getchar(); int total = n*(n + 1) / 2; if (total % 2 == 1) { printf("0"); return 0; } dp[0] = 1; int tmp = 0; for (int j = 1; j = 0; i--) { dp[i + j] += dp[i]; } tmp+=j; } int rst = dp[total / 2] / 2; printf("%d", rst);}Colored by Color Scriptercs 2019. 2. 9. 9251 LCS 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051#include #include #include using namespace std; int dp[1001][1001] = { 0 };char a[1001], b[1001], result[1001] = { 0 }; int main() { scanf("%s %s", &a, &b); getchar(); int n = strlen(a); int m = strlen(b); for (int i = 0; i 2019. 2. 9. 1149 RGB거리 12345678910111213141516171819202122232425262728#include #include using namespace std;int a[1001][4] = { 0 };int dp[1001][4] = { 0 }; int main() { int n; scanf("%d", &n); getchar(); for (int i = 1; i 2019. 2. 9. 1463 1로 만들기 1234567891011121314151617181920212223242526272829#include #include #include using namespace std; int main() { int max = 1000001,n; vector dp(max,10000); dp[1] = 0; scanf("%d", &n); getchar(); for (int i = 1; i 2019. 2. 8. 2600 구슬게임 12345678910111213141516171819#include int dp[100] = { 0 }; int main() { int n; scanf("%d", &n); getchar(); dp[1] = 1; dp[2] = 2; dp[3] = 4; for (int i = 4; i 2019. 2. 8. 01knapsack 더블릿 (복습 필요) 123456789101112131415161718192021222324252627282930313233343536#include #include using namespace std; int profit[300] = { 0 };int weight[300] = { 0 };int ans[300][11000] = { 0 }; int main() { int w, n; scanf("%d %d", &w, &n); getchar(); for (int i = 1; i 2019. 2. 8. sumset 더블릿 123456789101112131415161718192021#include int dp[1100000] = { 0 }; int main() { int n; scanf("%d", &n); getchar(); dp[1] = 1; dp[2] = 2; for (int i = 3; i 2019. 2. 8. 분할수 더블릿 123456789101112131415161718192021222324252627#include int dp[100][100] = { 0 }; int main() { int n; scanf("%d", &n); getchar(); for (int i = 1; i 2019. 2. 8. 1932 정수삼각형 (숫자 삼각형 더블릿) 123456789101112131415161718192021222324252627282930313233#include #include using namespace std; int arr[510][510] = { 0 };int dp[510][510] = { 0 }; int main() { int n; scanf("%d", &n); getchar(); for (int i = 1; i 2019. 2. 7. 1010 다리놓기 12345678910111213141516171819202122232425262728293031#include #include using namespace std; int dp[40][40] = { 0 }; int main() { int t,a,b; scanf("%d", &t); getchar(); while(t--){ for (int i = 1; i 2019. 2. 7. 이전 1 ··· 31 32 33 34 35 다음