//1_5_5: Dirchlet's Theorem on Arithmetic Progressions 写第i个素数 POJ3006
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int isprime(int n)
{
int i;
int sq = (int)sqrt((double)n) + 1;
if(n == 1) return 0;
if(n == 2) return 1;
for(i = 2;i < sq;i ++) if(n % i == 0) return 0;
return 1;
}
int main()
{
int a,d,n,cnt;
while(1)
{
scanf("%d%d%d",&a,&d,&n);
if(a == 0 || d == 0 || n == 0) break;
cnt = 0;
if(isprime(a)) cnt++;
while(cnt < n)
{
a += d;
if(isprime(a)) cnt++;
}
printf("%d\n",a);
}
return 0;
}
/*测试结果:通过POJ3006检测
367 186 151
92809
179 10 203
6709
271 37 39
12037
103 230 1
103
27 104 185
93523
253 50 85
14503
1 1 1
2
9075 337 210
899429
307 24 79
5107
331 221 177
412717
259 170 40
22699
269 58 102
25673
0 0 0
请按任意键继续. . .
*/
POJ3006 Dirchlet's Theorem on Arithmetic Progressions
最新推荐文章于 2019-05-23 23:25:59 发布