#include<iostream>
#include<algorithm>
#include<cmath>
using?namespace?std;
const?long?long?size=100000;//修改size的數(shù)值以改變最終輸出的大小
long?long?zhishu[size/2];
void?work(){//主要程序
????zhishu[1]=2;
????long?long?k=2;
????for(long?long?i=3;i<=size;i++){//枚舉每個數(shù)
????????bool?ok=1;
????????for(long?long?j=1;j<k;j++){//枚舉已經(jīng)得到的質(zhì)數(shù)
????????????if(i%zhishu[j]==0){
????????????????ok=!ok;
????????????????break;
????????????}
????????}
????????if(ok){
????????????zhishu[k]=i;
????????????cout<<"count"<<k<<'?'<<i<<endl;
????????????k++;
????????}
????}
}
int?main(){
????freopen("zhishu.out","w",stdout);
????cout<<"count1?2"<<endl;
????work();
????return?0;
}
bool?isPrime(unsigned?long?n)?{
????if?(n?<=?3)?{
????????return?n?>?1;
????}?else?if?(n?%?2?==?0?||?n?%?3?==?0)?{
????????return?false;
????}?else?{
????????for?(unsigned?short?i?=?5;?i?*?i?<=?n;?i?+=?6)?{
????????????if?(n?%?i?==?0?||?n?%?(i?+?2)?==?0)?{
????????????????return?false;
????????????}
????????}
????????return?true;
????}
}

注： 這是摘自百度百科的代碼，可以參考一下。