21PAT甲级春季 Arithmetic Progression of Primes

#include <cstdio>
const int maxn = 100010;
int prime[maxn],pNum = 0;
bool p[maxn] = {false};

void findPrime(int n)
{
    p[0] = p[1] = true;
    for(int i = 2; i <= n; i++)
    {
        if(p[i] == false)
        {
            prime[pNum++] = i;
            for(int j = i + i; j <= n; j += i) p[j] = true;
        }
    }
}

int n,MAXP;
int maxdif = -1,maxV = -1;
int main()
{
    scanf("%d %d",&n,&MAXP);
    findPrime(MAXP);
    int maxDif;
    if(n != 1) maxDif = MAXP / (n - 1);
    else maxDif = MAXP;
    for(int i = pNum - 1; i >= 0; i--)
    {
        int count,difference;
        for(int j = i - 1; j >= 0; j--)
        {
            count = 2;
            difference = prime[i] - prime[j];
            if(difference > maxDif) break;
            int next = prime[j] - difference;
            while(p[next] == false and count <= n and next >= 2)
            {
                next = next - difference;
                count++;
            }
            if(count == n) break;
        }
        if(count == n and difference > maxdif)
        {
            maxdif = difference;
            maxV = prime[i];
        }
    }
    if(maxdif == -1) printf("%d",prime[pNum - 1]);
    else
    {
        for(int i = 1; i <= n; i++)
        {
            if(i != n) printf("%d ",maxV - maxdif * (n - i));
            else printf("%d",maxV);
        }
    }
}