PS 부수기
Project Euler #31 : Coin sums 본문
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | int main() { int cnt = 0; for (int a = 0; a * 200 <= 200; a++) { for (int b = 0; a * 200 + b * 100 <= 200; b++) { for (int c = 0; a * 200 + b * 100 + c * 50 <= 200; c++) { for (int d = 0; a * 200 + b * 100 + c * 50 + d * 20 <= 200; d++) { for (int e = 0; a * 200 + b * 100 + c * 50 + d * 20 + e * 10 <= 200; e++) { for (int f = 0; a * 200 + b * 100 + c * 50 + d * 20 + e * 10 + f * 5 <= 200; f++) { for (int g = 0; a * 200 + b * 100 + c * 50 + d * 20 + e * 10 + f * 5 + g * 2 <= 200; g++) { cnt++; } } } } } } } cout << cnt; } | cs |
'Project Euler' 카테고리의 다른 글
Project Euler #33 : Digit cancelling fractions (0) | 2020.08.08 |
---|---|
Project Euler #32 : Pandigital products (0) | 2020.08.08 |
Project Euler #30 : Digit fifth powers (0) | 2020.08.08 |
Project Euler #29 : Distinct powers (0) | 2020.08.08 |
Project Euler #28 : Number spiral diagonals (0) | 2020.08.08 |
Comments