POJ 3006 Dirichlet's Theorem on Arithmetic Progressions
来源:互联网 发布:淘宝手机版怎么贷款 编辑:程序博客网 时间:2024/05/10 05:59
分析:
这道题要先用筛法求出10^6以内的素数。。。。我竟然觉得数据太多没用这种方式,然后写出来的代码就运行超时了,呜呜……最后还是用的筛法
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 <cstring>#include <string>#include <cmath>using namespace std;const int maxn=1000010;int i,j,k[maxn];int main(){int a,d,n,l;j=0;memset(k,0,sizeof(k));k[0]=k[1]=1;for(i=2;i<maxn/2;i++){if(!k[i])for(j=i*2;j<maxn;j+=i)k[j]=1;}/*<span style="white-space:pre"></span>这里,小范围测试一下,筛法有没有出错。。for(j=0;j<1000;j++)if(!k[j])cout<<j<<" ";*/while(cin>>a>>d>>n && (a+d+n>0)){for(i=a,l=0;l<n;i+=d){if(!k[i])++l;}cout<<i-d<<endl;}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
- 几种Json工具包的解析速度对比
- 欢迎使用CSDN-markdown编辑器
- 如何利用SQL查询语句从SQLSERVER数据库中导入导出EXCEL表格
- Openstack 命令行管理之glance镜像服务
- CSDN某分站SQL盲注漏洞(附poc)===== 时间延迟
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions
- 浅谈C++多态性
- The spatial index grid size is invalid 问题解决
- JavaScript 学习笔记(1):关于函数、对象以及面向对象
- 黑马程序员--协议和代理
- IntelliJ IDEA /Android Studio显示文档
- 揭秘LocalBroadcastManager实现原理
- 黑马程序员--Java概述
- android webview实现进度条效果