POJ-3006 Dirichlet's Theorem on Arithmetic Progressions
来源:互联网 发布:ubuntu没有win7启动项 编辑:程序博客网 时间:2024/04/28 04:41
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
Japan 2006 Domestic
水题。。附AC代码
#include<stdio.h>#include<stdio.h>#include<string.h>#include<math.h>int a[100000],b[500];int prime(int x){int y;if(x==1) return 0; for(y=2;y<=sqrt(x);y++){if(x%y==0){return 0;}}return 1;}int main(){int i,j,x,y,z,sum;while(scanf("%d %d %d",&x,&y,&z)!=EOF){if(x==0&&y==0&&z==0) break; memset(a,0,sizeof(a));i=0;for(sum=0;sum<=z+1;i++){if(i==0) a[0]=x;elsea[i]=a[i-1]+y;if(prime(a[i])) {b[sum]=a[i];sum++;}}printf("%d\n",b[z-1]);}return 0;}
- 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 【素数筛】
- 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
- 销毁 Activity
- Android 使用传感器改变屏幕方向
- dede - 将网站地图sitemap和rss生成到根目录
- Viewpager做无限循环遇到的出现短暂空白的问题
- (R-CNN)Rich feature hierarchies for accurate object detection and semantic segmentation
- POJ-3006 Dirichlet's Theorem on Arithmetic Progressions
- php开启openssl的方法
- Android之AlarmManager(全局定时器/闹钟)指定时长或以周期形式执行某项操作
- SQL SERVER日常运维巡检系列之五——实例级参数
- win10 Hyper中Ubunto和物理机共享文件
- 开启MySQL远程访问的权限
- JS语言学习----面向对象编程
- java 单例模式之旅
- Java 实现系统权限控制思路