I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)
来源:互联网 发布:cf英雄武器抽奖 软件 编辑:程序博客网 时间:2024/06/05 04:30
Description
If a and d are relatively prime positive integers, the arithmetic sequence beginning witha 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 thenth prime number in this arithmetic sequence for given positive integersa, d, and n.
Input
The input is a sequence of datasets. A dataset is a line containing three positive integersa, d, and n separated by a space. a and d are relatively prime. You may assumea <= 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 thenth prime number among those contained in the arithmetic sequence beginning witha 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>using namespace std;bool is_prime(int n){ int i; if(n<=1) return false; else if(n==2) return true; else if(n%2==0) return false; else { for(i=3;i*i<=n;i+=2) if(n%i==0) return false; return true; }}int main(){ long a,d,n,cnt,s; while(cin>>a>>d>>n&&(a||d||n)) { for(s=a,cnt=0;cnt<n;s+=d) //cnt用来计数素数的个数 { if(is_prime(s)) cnt++; } cout<<s-d<<endl; // 最后一次执行完毕后多加了一个d,所以要减去 } return 0;}
- I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)
- I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)
- (素数求解)I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)
- POJ3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ3006:Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- poj3006 Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- POJ3006 Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions
- 3006. Dirichlet's Theorem on Arithmetic Progressions
- 《数据结构编程实验》 1.5.5Dirichlet's Theorem on Arithmetic Progressions
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数表)
- poj 3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 素数
- iOS开发进阶精华贴索引
- oracle安全有关的对象
- ExecutorService与Executors例子的简单剖析
- 为什么setTimeout(fn, 0) 会起作用?
- NSArray打印对象
- I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)
- POJ3190 Stall Reservations 贪心
- uva 755(排序、检索)
- IT运维问道---文启
- linux下unordered_map和map在小数据下性能差异
- Linux内核通知链模块
- 加载gif图片
- c++基础浅谈一开始学习c++
- POJ 3660 Cow Contest(Floyd传递闭包)