(DS1.5.5)POJ 3306 Dirichlet's Theorem on Arithmetic Progressions(在一个数列之中寻找第n个素数)
来源:互联网 发布:yy网络直播红人 编辑:程序博客网 时间:2024/05/20 05:27
/* * POJ_3006.cpp * * Created on: 2013年10月23日 * Author: Administrator */#include <iostream>#include <cstdio>using namespace std;const int maxn = 10011;//不要开得太大,否则会超时bool u[maxn];//判断某一个数是否是素数int su[maxn];//素数表int num = 0;//素数的个数//产生素数表.需要注意的是,1不是素数void prepare() {int i, j;memset(u, true, sizeof(u));for (i = 2; i < maxn; ++i) {if (u[i]) {su[++num] = i;}for (j = 1; j <= num; ++j) {if (i * su[j] > maxn) {break;}u[i * su[j]] = false;if (i % su[j] == 0) {break;}}}}//判断一个数是否是素数bool pri(int x) {if (x <= 10010) {return u[x];}int i;for (i = 1; i <= num; ++i) {if (x % su[i] == 0) {return false;break;}}return true;}int main(){prepare();int a,d,n;u[1] = false;//1不是素数while(scanf("%d%d%d",&a,&d,&n)!=EOF,a||d||n){int m;int cnt = 0;for(m = a ; cnt < n ; m+=d){if(pri(m)){cnt++;}}printf("%d\n",m-d);}return 0;}
- (DS1.5.5)POJ 3306 Dirichlet's Theorem on Arithmetic Progressions(在一个数列之中寻找第n个素数)
- 【POJ 3306】【素数筛选】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 【素数筛】
- Dirichlet's Theorem on Arithmetic Progressions(素数筛)
- Dirichlet's Theorem on Arithmetic Progressions 筛取素数
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 素数的判断 筛选法
- POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数筛选法) --from lanshui_Yang
- 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 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
- 排序之三(堆排序)
- C++类对象内存结构
- 【android】scaleType属性与ImagView中图片的显示的关系
- 面试总结,多进程和多线程的区别
- 正则表达式常用例子总结
- (DS1.5.5)POJ 3306 Dirichlet's Theorem on Arithmetic Progressions(在一个数列之中寻找第n个素数)
- nodejs中的==、===、!=、!==的区别
- tomcat插件下载
- Html js 选项卡效果
- SendMessage 的各种参数
- 7 计算学习理论
- bootloader和bootstrap的区别
- php之jquery学习
- Android 中的 Service 全面总结