Algorithm/BOJ
-
동전 2 - 2294Algorithm/BOJ 2020. 3. 1. 16:49
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 //2293 - 동전 2 //슬라이딩 윈도우 최적화 #include using namespace std; #define INF 100000 int N, K; int arr[100]; int cache[10001]; void init() { cin >> N >> K; for (int i = 0; i > arr[i]; for (int i = 0; i
-
동전 1 - 2293Algorithm/BOJ 2020. 3. 1. 16:09
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 //2293 - 동전 1 //슬라이딩 윈도우 최적화 #include using namespace std; int N, K; int arr[100]; int cache[10001]; void init() { cin >> N >> K; for(int i = 0; i> arr[i]; cache[0] = 1; } int dp(int cost) { if(cost arr[i]; cache[0][0] = cache[1][0] = 1; } int dp(int idx, int cost) { if (cost
-
GPA - 17662Algorithm/BOJ 2020. 2. 28. 18:58
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 //17662 - GPA #include #include #include using namespace std; int C, M, S; map cunit; vector mname; vector mclass; map studen..
-
Cap Size - 17659Algorithm/BOJ 2020. 2. 28. 18:55
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 //17659 - cap size #include using namespace std; int N, K; bool arr[1001]; int lower, uppe..
-
Mangling Names - 17661Algorithm/BOJ 2020. 2. 28. 18:51
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 //17661 - Mangling Names #include using namespace std; int N, K; int ans; int arr[31][31]; void init() { scanf("%d%d", &N, &K); ans = 0; for(int i = 0; i