CCF CSP试题编号： 202312-2试题名称： 因子化简

题目中提到关键词素数 我们可以尝试求一下1000以内的素数 足以表示数据

int a[1000]={0};
a[0]=a[1]=1;
	for(int i=3;i<=1000;i++){
		for(int j=2;j<i;j++){
			if(i%j==0){
				a[i]=1;
			}
		}
	}
	for(int i=0;i<=1000;i++){
		if(a[i]!=1)cout<<i<<",";
	}

将素数存入数组 即可以按照题目要求编写代码

#include <iostream>
#include <algorithm>
using namespace std;
int sushu[1000]={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};
int main()
{
	int q;
	cin>>q;
	
	while(q--){
		long long sum=1;
		long long cnt=0;
		long long n,k;
		cin>>n>>k;
		for(int i=0;i<100;i++){
				while(n%sushu[i]==0){
					n/=sushu[i];
					cnt++;
				}
				if(cnt>=k){
				sum*=pow(sushu[i],cnt);
				}
				cnt=0;
		}
		cout<<sum<<endl;
		}
}