다락방

19532 수학은 비대면강의입니다 #include using namespace std; int main() { int a, b, c, d, e, f; cin >> a >> b >> c >> d >> e >> f; for (int i = -999; i

2231 분해합 #include using namespace std; int main() { int N; int result = 0; cin >> N; for (int i = 1; i < N; i++) { int sum = 0; int num = i; while (num != 0) { sum += num % 10; num /= 10; } if (sum + i == N) { result = i; break; } } cout

2798 블랙잭 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int num, goal, sum,max = 0; cin >> num >> goal; vector num_arr(num); for (int i = 0; i > input; num_arr[i]= input; } for (int i = 0; i < num-2; ++i) { for (int j = i + 1 ;j < num - 1; ++j) { for (int k = j + 1; k < num; ++k) { sum = num_arr[i] + num_a..

11653 소인수분해 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int num, n=2; cin >> num ; while (num > 1) { if (0 == num % n) { num = num / n; cout

9506 약수들의 합 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); while (true) { int num; int check_num = 0; vector num_arr; cin >> num; if (-1 == num) break; for (int i = 1; i

2501 약수 구하기 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int num, index; vector num_arr; cin >> num >> index; for (int i = 1; i

5086 배수와 약수 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); while (true) { int a, b; cin >> a >> b; if (0 == a && 0 == b) break; if (0 == b % a) cout

2563 색종이 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test_case, row = 100, column = 100, ans = 0; vector int_arr(row,vector(column)); cin >> test_case; for (int i = 0; i > witdh >> height; for (int x = witdh; x < witdh + 10; ++x) { for (int y = height; y < height + 10; ++y) { if (0 == ..

10798 세로읽기 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector str_arr(5); string input_string; for (int i = 0; i > input_string; str_arr[i] = input_string; } for (int j = 0; j < 15; ++j) { for (int i = 0; i < 5; ++i) { if (str_arr[i].size()-1 < j) continue; cout

https://www.acmicpc.net/problem/2566 2566 최댓값 #include using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int row = 9, col = 9 ,max =0, idi=0, idj=0; vector ij_arr(row, vector(col)); for (int i = 0; i > input_num; if (input_num > max) { max = input_num; idi = i; idj = j; } } } cout