poj 3006
来源:互联网 发布:java类库 编辑:程序博客网 时间:2024/06/14 09:26
很简单的一道素数题,注意的是,判断素数时要多考虑上1
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<string>#include<string.h>using namespace std;#include<algorithm> #include<math.h>bool prime(int a){if(a==1)return false;for(int i=2;i<=sqrt(a+0.0);i++){if(a%i==0)return false;}return true; } int main(){int a,d,n;while(cin>>a>>d>>n,a+d+n){int x=a;long long int count=0;while(count!=n){if(prime(x))count++;x+=d;}if(a==1&&d==1&&n==1)cout<<2<<endl;elsecout<<x-d<<endl;} return 0;}
- POJ-3006
- poj 3006
- POJ 3006
- POJ 3006
- poj 3006
- poj-3006
- POJ-3006
- poj 3006
- acm poj 3006
- POJ 3006解题报告
- POJ 3006
- POJ 3006 解题报告
- poj 3006(水题)
- POJ
- poj
- POJ
- POJ
- poj
- ArrayList源码分析
- C语言第三课
- 吃过的药—身体是自己的
- lucene、solr区别
- xdoj 1234: 尧老师要教孩子玩球球
- poj 3006
- 2852小鑫爬山(三角形内路径最小)
- iOS 播放系统提示音和使用系统方法播放本地提示音
- 如何利用数字万用表判断功率模块的好坏
- 判断字符串是否为空,是否为数字
- 高德地图之实例开发(一)加载地图
- linuxshell 脚本攻略读书笔记
- C语言第四课
- CodeForces