POJ3006 解题报告

#include<iostream>#include<string>using namespace std;const int MAX=1000000;bool prime[MAX];int main(){memset(prime,1,MAX);prime[0]=0;prime[1]=0;for(int i=2;i<MAX;i++){if(prime[i]){for(int j=2; j*i<MAX; ++j)prime[j*i]=0;}}int a,d,n;while(cin>>a>>d>>n){if(a==0 || d==0 || n==0)return 0;int num=0;while(1){if(prime[a]){num++;if(num==n)break;}a+=d;}cout<<a<<endl;}return 0;}