c/c++求素数的优化

参考csp认证20231202因子化简

求1~n以内的素数基础是：

int isPrime(int n) {
    if (n == 2) return 1;
    for (int i = 2; i < n; i++)
        if (n % i == 0) return 0;
    return 1;
}

优化，判断到根号n：

int isPrime(int n) {
    for (int i = 2; i <= sqrt(n); i++)
        if (n % i == 0) return 0;
    return 1;
}

优化，Eratosthenes筛法：

偶数放最后判断，从2i,3i,4i...这样开始筛。

void primenum() {
	vector<bool> isprime(MAX, true);
	for (int i = 3; i < sqrt(MAX); i+=2) {
		for (int j = i + i; j < MAX; j += i) {
			isprime[j] = false;
		}
	}
	int kk = 1; pri[0] = 2;
	for (int i = 2; i < MAX; i++) {
		if (i % 2 != 0 && isprime[i]) {
			pri[kk++] = i;
		}
	}
}

i*i之前的合数一定是某个小于i的素数的倍数，在前面的循环中已经被筛掉了，所以j可以直接从i*i开始循环。

void primenum() {
	vector<bool> isprime(MAX, true);
	for (int i = 3; i < sqrt(MAX); i+=2) {
		for (int j = i * i; j < MAX; j += i) {
			isprime[j] = false;
		}
	}
	int kk = 1; pri[0] = 2;
	for (int i = 2; i < MAX; i++) {
		if (i % 2 != 0 && isprime[i]) {
			pri[kk++] = i;
		}
	}
}

这种题把质数数组拉出来放新数组里做比较好，时间复杂度低很多。题解代码如下：

#include<iostream>
#include<vector>
#include<math.h>
using namespace std;

const int MAX = 1001;
//int pri[MAX];

/*
void primenum() {
	vector<bool> isprime(MAX, true);
	for (int i = 3; i < sqrt(MAX); i++) {
		for (int j = i * i; j < MAX; j += i) {
			isprime[j] = false;
		}
	}
	int kk = 1; pri[0] = 2;
	for (int i = 2; i < MAX; i++) {
		if (i % 2 != 0 && isprime[i]) {
			pri[kk++] = i;
		}
	}
}*/

int pri[] = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997 };


int main() {
	//primenum();
	/*for (int i = 0; i <= sizeof(pri) / sizeof(pri[0]); i++)
	{
		cout << pri[i] << ' ';
	}*/
	int q;
	cin >> q;
	while (q--) {
		long long n, k, ans = 1;
		cin >> n >> k;
		for (int i = 0; n > 1 && i < sizeof(pri)/sizeof(pri[0]); i++) {
			int count = 0;
			while (n % pri[i] == 0) {
				count++;
				n = n / pri[i];
			}
			if (count >= k) {
				for (int j = 0; j < count; j++) {
					ans = ans * pri[i];
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}