POJ - 3006 - Dirichlet's Theorem on Arithmetic Progressions = 水题

给一个等差数列，求其中的第n个质数，答案保证不超过1e6。n还特别小？！！！

埃筛之后暴力。

#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;

bool np[1000005];

int main() {
#ifdef Yinku
    freopen("Yinku.in", "r", stdin);
#endif // Yinku
    np[1] = 1;
    for(int i = 2; i <= 100000; ++i) {
        if(np[i])
            continue;
        else {
            for(int j = i + i; j <= 1000000; j += i)
                np[j] = 1;
        }
    }
    int a, d, n;
    while(cin >> a >> d >> n) {
        if(a == 0 && d == 0 && n == 0)
            break;
        while(1) {
            if(!np[a])
                n--;
            if(n == 0) {

                cout << a << endl;
                break;
            }
            a += d;
        }
    }
}

原文地址：https://www.cnblogs.com/Inko/p/11723374.html

时间： 2024-12-14 16:03:35

POJ - 3006 - Dirichlet's Theorem on Arithmetic Progressions = 水题的相关文章

poj 3006 Dirichlet's Theorem on Arithmetic Progressions

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 Theore

POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 素数难度:0

http://poj.org/problem?id=3006 #include <cstdio> using namespace std; bool pm[1000002]; bool usd[1000002]; bool judge(int x) { if(usd[x])return pm[x]; usd[x] = true; if(x == 2) return pm[x] = true; if(((x & 1) == 0) || (x < 2))return pm[x] =

POJ 3006 Dirichlet's Theorem on Arithmetic Progressions 快筛质数

题目大意:给出一个等差数列,问这个等差数列的第n个素数是什么. 思路:这题主要考如何筛素数,线性筛.详见代码. CODE: #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define MAX 1000010 using namespace std; int prime[MAX],primes; bool notp[MAX]; int a,d,n;

Dirichlet's Theorem on Arithmetic Progressions POJ - 3006 线性欧拉筛

题意给出a d n 给出数列 a,a+d,a+2d,a+3d......a+kd 问第n个数是几保证答案不溢出直接线性筛模拟即可 1 #include<cstdio> 2 #include<cstring> 3 using namespace std; 4 bool Is_Primes[1000005]; 5 int Primes[1000005]; 6 int A[1000005]; 7 int cnt; 8 void Prime(int n){ 9 cnt=0; 1

（素数求解）I - Dirichlet's Theorem on Arithmetic Progressions(1.5.5)

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status 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

poj3006 Dirichlet's Theorem on Arithmetic Progressions

Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16333 Accepted: 8205 Description If a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing

【POJ3006】Dirichlet's Theorem on Arithmetic Progressions（素数筛法）

简单的暴力筛法就可. 1 #include <iostream> 2 #include <cstring> 3 #include <cmath> 4 #include <cctype> 5 #include <cstdio> 6 #include <cmath> 7 #include <algorithm> 8 #include <numeric> 9 using namespace std; 10 11 co

判断素数——Dirichlet's Theorem on Arithmetic Progressions

POJ 1269 Intersecting Lines（线段相交，水题）

Intersecting Lines 大意:给你两条直线的坐标,判断两条直线是否共线.平行.相交,若相交,求出交点. 思路:线段相交判断.求交点的水题,没什么好说的. struct Point{ double x, y; } ; struct Line{ Point a, b; } A, B; double xmult(Point p1, Point p2, Point p) { return (p1.x-p.x)*(p2.y-p.y)-(p1.y-p.y)*(p2.x-p.x); } bool