POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(我的水题之路——加i个d后的第几个素数)
来源:互联网 发布:数据侠客行 下载 编辑:程序博客网 时间:2024/05/17 03:00
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
Source
#include <cstdio>#include <cstdlib>#include <cstring>#define N 1000000int prime[N];void init(){ int i, j, k; for (i = 0; i < N; i++){ prime[i] = 1; } prime[0] = 0; prime[1] = 0; for (i = 0; i < N; i++){ if (prime[i] != 0){ for (j = i + i; j < N; j += i){ prime[j] = 0; } } }}int main(void){ int a, d, n; int times, i, tmp; init(); while (scanf("%d%d%d", &a, &d, &n), a != 0 || d != 0 || n != 0){ times = 0; for (i = a; i < 1000000 && times != n; i += d){ if (prime[i] != 0){ times++; tmp = i; } } printf("%d\n", tmp); } return 0;}
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(我的水题之路——加i个d后的第几个素数)
- 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 【素数筛】
- 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 ( 素数、筛选)
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数筛+等差数列)
- POJ 3006(Dirichlet's Theorem on Arithmetic Progressions T) 素数判定入门 Java
- 【POJ 3306】【素数筛选】Dirichlet's Theorem on Arithmetic Progressions
- (DS1.5.5)POJ 3306 Dirichlet's Theorem on Arithmetic Progressions(在一个数列之中寻找第n个素数)
- (素数求解)I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)
- 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
- VS2008中的调试技巧
- 交互设计学习笔记之《如何设计帮助系统》【交互设计】
- 抽象类和接口的区别,使用场景
- 插入mssql数据库是问号
- 汇编
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(我的水题之路——加i个d后的第几个素数)
- Building Coder(Revit 二次开发) - 只加载需要的族类型
- 用CAJViewer识别图片文字
- 程序设计实践课
- ycsb测试mongo笔记
- C++程序设计实验报告(一)
- Deadlock retry logic will not be implemented
- 关于浮动的前世今生
- apache的两种工作模式