목록Project Euler (37)
PS 부수기
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 int main() { vector s(100); rep(i, 0, 100) { cin >> s[i]; } int prevSum = 0; VI ans; for (int i = 49; i >= 0; i--) { int sum = 0; for (int j = 0; j
1234567891011121314151617181920212223int main() { int sum = 0; for (int i=1 ; ; i++) { sum += i; int temp = sum; int yaksuCnt = 1; for (int j = 2; j = 500) { cout
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 27 28 29 30 31 32 int main() { vector a(20, vector(20)); rep(i, 0, 20) { rep(j, 0, 20) { cin >> a[i][j]; } } int mmax = -1; rep(i, 0, 20) { rep(j, 0, 17) { mmax = max(mmax, a[i][j] * a[i][j + 1] * a[i][j + 2] * a[i][j + 3]); } } rep(i, 0, 20) { rep(j, 0, 17) { mmax = max(mmax, a[j][i] * a[j + 1][i] * a[j + 2][i] * a[j + 3][i]);..
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 int main() { vector isPrime(2000001); isPrime[1] = 1; for (int i = 2; i
1 2 3 4 5 6 7 8 9 10 11 12 int main() { for (int i = 1; i
1 2 3 4 5 6 7 8 9 10 11 12 13 int main() { string s = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930..
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 int main() { int cnt = 1; VI primes = { 2 }; int isPrime = 3; while (1) { bool suc = true; rep(i, 0, primes.size()) { if (isPrime % primes[i] == 0) { suc = false; break; } } if (suc) { primes.push_back(isPrime); } isPrime++; if (primes.size() == 10001) { cout