问题描述: 怎么证明一个数为质数 1个回答 分类:综合 2014-11-01 问题解答: 我来补答 C++代码int main(){const int max =100;long primes[max] = {2,3,5 };long trial = 5;int count =3;int found =0;do{trial +=2;for(int i=0;i< count;i++){found = (trial % *(primes + i)) == 0;if(found)break;}if(found == 0)*(primes + count++) = trial;}while(count < max);return 0;} 展开全文阅读