poj3006
来源:互联网 发布:广州成易软件 编辑:程序博客网 时间:2024/06/05 17:19
Description
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 151179 10 203271 37 39103 230 127 104 185253 50 851 1 19075 337 210307 24 79331 221 177259 170 40269 58 1020 0 0
Sample Output
928096709120371039352314503289942951074127172269925673
#include <iostream>#include<stdio.h>#define NUMBER 1000000+1using namespace std;bool prime1[NUMBER+111];int prime[NUMBER/10+1];int getprime(){for(int i=2;i<=NUMBER;i++){if(i%2==0)prime1[i]=0;else prime1[i]=1;}prime1[2]=1;prime1[1]=0;for(int i=3;i<=NUMBER;i++){if(i*i>NUMBER)break;if(prime1[i]){for(int j=i;j*i<=NUMBER;j++)prime1[j*i]=0;}}int count=0;for(int i=2;i<=NUMBER;i++){if(prime1[i])prime[++count]=i;}return count;}int getanswer(int a,int b,int n,int count){int i=0;for(i=1;i<=count;i++){if(prime[i]>=a&&(prime[i]-a)%b==0){n--;}if(n==0)break;}return prime[i];}int main(){int a,b,n;int count=getprime();while(1){cin>>a>>b>>n;if(a==0&&b==0&&n==0)break;cout<<getanswer(a,b,n,count)<<endl;}return 0;}
- poj3006
- poj3006
- poj3006
- poj3006
- poj3006
- POJ3006
- poj3006
- poj3006
- POJ3006
- POJ3006
- poj3006
- poj3006
- POJ3006
- poj3006
- poj3006
- poj3006 素数
- POJ3006 解题报告
- poj3006(素数筛法)
- rh401 - rpmbuild更改BuildArch后碰到错误(error: Arch dependent binaries in noarch package)
- ARM汇编中LR(R14)寄存器的作用
- spring之aop
- 3通道滤波
- edit框添加与赋值的两种方法
- poj3006
- 20个经典的Java应用
- spi
- Android完全退出的4种方法
- webservice xfire实现的一个超简单的例子
- Activity 退出
- ---- 枚举
- hibernate oid
- 无所事事了一晚上