목록Project Euler (37)
PS 부수기
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 26 int main() { VI primes = { 2, 3, 5, 7, 11, 13, 17, 19 }; VI ans(8); rep(i, 1, 21) { rep(j, 0, 8) { int primesCnt = 0; int temp = i; while (1) { if (temp % primes[j] == 0) { primesCnt++; temp /= primes[j]; } else break; } ans[j] = max(ans[j], primesCnt); } } llong ANS = 1; rep(i, 0, 8) { rep(j, 0, ans[i]) { ANS *= primes[i]; } }..
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 int main() { int mmax = -1; rep(i, 1, 10) { rep(j, 0, 10) { rep(k, 0, 10) { int NUM = i + j * 10 + k * 100 + k * 1000 + j * 10000 + i * 100000; rep(l, 100, 1000) { if (NUM % l == 0 && NUM / l >= 100 && NUM / l
1 2 3 4 5 6 7 8 9 10 11 12 13 14 int main() { llong NUM = 600851475143; llong maxx = -1; for(llong i =2 ; i
1 2 3 4 5 6 7 8 9 10 int main() { int prev = 2; int prevprev = 1; sum = 2; while (1) { int cur = prev + prevprev; if(cur%2) } cout