1. problem : https://www.acmicpc.net/problem/11659  2. solution 1:#include using namespace std;int n, m;int nums[100005]; int idx_sum[100005]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for (int i = 1; i > nums[i]; idx_sum[1] = nums[1]; for (int i = 2; i > i >> j; cout  3. solution 2: // Authored by : BaaaaaaaaaaarkingDog// Co-authored by : -// http://boj.kr/7df92c8..

1. problem : https://www.acmicpc.net/problem/11726 2. solution 1 :#include using namespace std;int n;int d[1005];int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; d[1] = 1, d[2] = 2; if (n

1. problem : https://www.acmicpc.net/problem/1149  2. solution 1:#include using namespace std;int n;int d[1005][3];int r[1005];int g[1005];int b[1005];int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i > r[i] >> g[i] >> b[i]; d[1][0] = r[1]; d[1][1] = g[1]; d[1][2] = b[1]; for (int i = 2; i source code 출처 : https://github.com/encrypted-def/basic-algo-lecture/bl..

1. problem : https://www.acmicpc.net/problem/9095 2. solution 1 :#include using namespace std;int t;int board[12];int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> t; while (t--) { int n; cin >> n; board[0] = 1, board[1] = 1, board[2] = 2; for (int i = 3; i

1. problem : https://www.acmicpc.net/problem/1463 2. solution 1:// Authored by : BaaaaaaaaaaarkingDog// Co-authored by : -// http://boj.kr/161694ef04f04d8dbe826e253622c1cb#include using namespace std;int d[1000005];int n;int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; d[1] = 0; for(int i = 2; i source code 출처 : https://github.com/encrypted-def/basic-algo-lecture/blob/master/..

1. problem : https://www.acmicpc.net/problem/7795 2. solution 1:#include using namespace std;int t;vector> vc;void mergeSort(vector>& v1, vector>& v2) { vector> temp; int v1idx = 0, v2idx = 0; for (int i = 0; i > t; for (int i = 0; i > va; vector> vb; cin >> n >> m; for (int i = 0; i > x; va.push_back(make_pair(x,'A')); } for (int i = 0; i > x; vb.push_back(make_pair(x, 'B')); } //..