2017/12/12(2)
-
[백준 7568번] 덩치
소스코드12345678910111213141516171819#include using namespace std; int n, a[3][51]; int main() { cin >> n; for (int i = 0; i > a[0][i] >> a[1][i]; for (int i = 0; i
2017.12.12 -
[백준 2231번] 분해합
소스코드123456789101112131415161718192021#include using namespace std; int cal(int num) { int sum = num; while (num!=0) { sum += num % 10; num /= 10; } return sum;} int main() { int n; cin >> n; for (int i = 1; i
2017.12.12