牛客数学-1
//欧几里得
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
//整数分解,求质数
//埃氏筛
const int maxn = 10000000;
bool not_prime[maxn + 5];
int prime[maxn + 5], tot = 0;
for (int i = 2; i <= n; i++) {
if (!not_prime[i]) {
prime[++tot] = i;
for (int
原创
2022-05-23 22:22:55 ·
77 阅读 ·
0 评论