Dirichlet's Theorem on Arithmetic Progressions------[NWPU][2018寒假作业][通用版]一、热身 [Cloned]O题

If a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d, a + 4d, …, contains infinitely many prime numbers. This fact is known as Dirichlet’s Theorem on Arithmetic Progressions, which had been conjectured by Johann Carl Friedrich Gauss (1777 - 1855) and was proved by Johann Peter Gustav Lejeune Dirichlet (1805 - 1859) in 1837.
For example, the arithmetic sequence beginning with 2 and increasing by 3, i.e.,
2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98, … ,
contains infinitely many prime numbers
2, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, … .
Your mission, should you decide to accept it, is to write a program to find the nth prime number in this arithmetic sequence for given positive integers a, d, and n.
Input
The input is a sequence of datasets. A dataset is a line containing three positive integers a, d, and n separated by a space. a and d are relatively prime. You may assume a <= 9307, d <= 346, and n <= 210.
The end of the input is indicated by a line containing three zeros separated by a space. It is not a dataset.
Output
The output should be composed of as many lines as the number of the input datasets. Each line should contain a single integer and should never contain extra characters.
The output integer corresponding to a dataset a, d, n should be the nth prime number among those contained in the arithmetic sequence beginning with a and increasing by d.
FYI, it is known that the result is always less than 106 (one million) under this input condition.
Sample Input
367 186 151
179 10 203
271 37 39
103 230 1
27 104 185
253 50 85
1 1 1
9075 337 210
307 24 79
331 221 177
259 170 40
269 58 102
0 0 0
Sample Output
92809
6709
12037
103
93523
14503
2
899429
5107
412717
22699
25673

解题思路：
虽然这是一道水题，但是从给出的输入输出事例，可以明显感觉到如果方法选择不当，很可能超时。
用最原始的isprime函数判断一个数是否是质数太过耗时。
因为题目中给出条件：输出的质数的上限是1000000，我们可以用筛法直接求出1到1000000内的所有质数，一劳永逸，之后就不用进行任何复杂的运算了。

int j=i*2;j<=1000000;j+=i
这样比挨个筛除更简洁。

#include<stdio.h>
#include<math.h>
#include<string.h>

int prime[1000001];
//为了不超时，先将一百万以内的素数用筛法求出来。 
void list()
{
    memset(prime,0,sizeof(prime));
    prime[0]=1;
    prime[1]=1;
    for(int i=2;i<=1000;i++)
    {
        if(prime[i]==0)
        {
            for(int j=i*2;j<=1000000;j+=i)
            {
                prime[j]=1;
            }
        }
    }
}

int main()
{
    list();
    int a,d,n;
    while(1)
    {
        scanf("%d%d%d",&a,&d,&n);
        if(a==0&&d==0&&n==0)
        {
            return 0;
        }
        int cnt=0;
        while(cnt!=n)
        {
            if(prime[a]==0)
            {
                cnt++;
            }
            a+=d;
        }
        printf("%d\n",a-d);
    }
}