难度渐渐上来了,不知道以后怎么办,这一道至少花去了我一个小时的时间。
主要是还筛法求素数
转载自:https://blog.csdn.net/lyy289065406/article/details/6642592
#include<memory.h>
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
const static int LEN = 1000000;
const static int SQRT_NUM = ceil(sqrt((double)LEN));
void findPrimes(bool* primes);
int findDirichletPrime(bool* primes, int a, int d, int n);
int main() {
freopen("in.txt","r",stdin);
bool primes[LEN] ;
findPrimes(primes);
int a, d, n;
while(cin >> a >> d >> n &&
a != 0 && d != 0 && n != 0) {
cout << findDirichletPrime(primes, a, d, n) << endl;
}
}
void findPrimes(bool* primes) {
memset(primes, true, sizeof(bool)*LEN);
primes[0] = primes[1] = false;
for(int i = 2; i <= SQRT_NUM; i++) {
if(!primes[i]) continue;
int multiple = 2;
while(true) {
int mNum = i * multiple;
if(mNum > LEN) break;
primes[mNum] = false;
multiple++;
}
}
}
int findDirichletPrime(bool* primes, int a,int d, int n) {
int ans = 0;
for(int cnt = 0, dirichlet = a; cnt < n; dirichlet += d) {
if(primes[dirichlet]) {
ans = dirichlet;
cnt++;
}
}
return ans;
}