목록Project Euler (37)
PS 부수기
Naive solution 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 33 34 35 36 37 38 39 40 41 42 43 44 int main() { IOS; ll ans=0; clock_t st, en; st=clock(); for(int i1=1;i1
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 int main() { IOS; long double x = 2; int cnt=0; for(long double k=0 ; ; k++) { long double l=(k+log10(123))/(log10(2)); long double r=(k+log10(124))/(log10(2)); int il = (int)l+1; int ir = (int)r; for(int t=il;t
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 33 34 35 36 37 38 vector isPrime(1000001); bool solve(int n) { set a; int digit = 0; int temp = n; while (temp > 0) { digit++; temp /= 10; } int pow = 1; for (int i = 1; i
12345678910111213141516171819202122232425VI 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
1 2 3 4 5 6 7 8 9 10 11 12 13 14 int main() { for (double a = 1; a
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 33 34 35 36 llong solve(VLL p, int index1, int index2) { int pow = 1, prod1 = 0, prod2 = 0, prod3 = 0; for (int i = index1; i >= 0; i--) { prod1 += pow * p[i]; pow *= 10; } pow = 1; for (int i = index2; i > index1 ; i--) { prod2 += pow * p[i]; pow *= 10; } pow = 1; for (int i = 8; i > index2; i--) { prod3 += p..
12345678910111213141516171819int main() { int cnt = 0; for (int a = 0; a * 200