YT基础回顾(一)1.9Dirichlet's Theorem on Arithmetic Progressions(素数判断)
来源:互联网 发布:李连杰甄子丹 知乎 编辑:程序博客网 时间:2024/04/29 19:56
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题目:给出a,d,n,求以a为首相,d为公差的等差数列的第n个素数,然后输出;此题一开始认为直接判断素数会超时,但是实在没想出啥好的方法就试了试,过了:算法如下:#include <iostream>#include<math.h>using namespace std;bool prime( int num){ if (num==2||num==3||num==5) return true; unsigned long c=7; if (num%2==0||num%3==0||num%5==0||num==1) return false; int maxc=int(sqrt(num)); while (c<=maxc) { if (num%c==0) return false; c+=4; if (num%c==0) return false; c+=2; if (num%c==0) return false; c+=4; if (num%c==0) return false; c+=2; if (num%c==0) return false; c+=4; if (num%c==0) return false; c+=6; if (num%c==0) return false; c+=2; if (num%c==0) return false; c+=6; } return true;}int main(){ int a,d,n,i,cnt; while(cin>>a>>d>>n&&(a||d||n)) { cnt=0; for(i=a;;i+=d) { if(prime(i)) cnt++; if(cnt==n) break; } cout<<i<<endl; } return 0;}
主要还是快速判断素数:
- YT基础回顾(一)1.9Dirichlet's Theorem on Arithmetic Progressions(素数判断)
- Dirichlet's Theorem on Arithmetic Progressions (poj 3009 水题)
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(水~)
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions ( 素数、筛选)
- (素数求解)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 T) 素数判定入门 Java
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数表)
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 素数
- poj 3006 Dirichlet's Theorem on Arithmetic Progressions 【素数筛】
- Dirichlet's Theorem on Arithmetic Progressions(素数筛)
- 【POJ 3306】【素数筛选】Dirichlet's Theorem on Arithmetic Progressions
- Dirichlet's Theorem on Arithmetic Progressions 筛取素数
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 素数的判断 筛选法
- 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
- 杯子和勺子
- PHP面向对象(OOP)编程完全教程:8.构造方法__construct()与析构方法__destruct()
- clearfix清除浮动闭合容器之:after与:before
- BinaryWriter 、BinaryReader在读写
- 海康大华RTSP格式
- YT基础回顾(一)1.9Dirichlet's Theorem on Arithmetic Progressions(素数判断)
- 从注册流程 分析如何安全退出多个Activity 多种方式(附DEMO)
- 匈牙利算法
- epool使用详解
- dojo小例子(21)grid新增记录放在第一行
- Codeforces 446B DZY Loves Modification 矩阵行列分开考虑 优先队列+构造
- Ogre粒子系统脚本详解
- js数组:string(字符串的对象包装类型),Array(引用类型)
- ucenter同步登录与同步退出