PS 부수기
Project Euler #34 : Digit factorials 본문
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 | VI fact; bool solve(int n) { int sum = 0; int temp = n; while (n > 0) { sum += fact[n % 10]; n /= 10; } return temp == sum; } int main() { fact.push_back(1); int mul = 1; for (int i = 1; i <= 9; i++) { mul *= i; fact.push_back(mul); } llong sum = 0; for (int i = 3; i <= 10000000; i++) { if (solve(i)) sum += i; } cout << sum; } | cs |
'Project Euler' 카테고리의 다른 글
Project Euler #686 : Powers of Two (0) | 2021.09.13 |
---|---|
Project Euler #35 : Circular primes (0) | 2020.08.08 |
Project Euler #33 : Digit cancelling fractions (0) | 2020.08.08 |
Project Euler #32 : Pandigital products (0) | 2020.08.08 |
Project Euler #31 : Coin sums (0) | 2020.08.08 |
Comments