原题目:
题目大意:
求由10亿个1组成的10亿位数的,前40个质因数的和。
解题思路:
代码:
ll ans1 = 0;
void solve() {
ll i, j,k,x,y,p,q;
ll N = 1000000;
p = 1000000000;
k = 0;
M.Prime.get_prime_Euler(1000000);
for (i = 1; i <= M.Prime.pcnt; i++) {
x = M.Prime.prime[i];
y = M.Prime.prime_pow(10, p, 9 * x);
if (y == 1) {
k++;
printf("%lld %lld\n", k, x);
ans1 = ans1 + x;
}
if (k == 40)break;
}
printf("%lld\n", ans1);
}