POJ 2689 Prime Distance 素数筛法
来源:互联网 发布:几大网络手机卡对比 编辑:程序博客网 时间:2024/05/23 18:33
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17075 Accepted: 4556DescriptionThe branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primality. A prime number is a number that is has no proper factors (it is only evenly divisible by 1 and itself). The first prime numbers are 2,3,5,7 but they quickly become less frequent. One of the interesting questions is how dense they are in various ranges. Adjacent primes are two numbers that are both primes, but there are no other prime numbers between the adjacent primes. For example, 2,3 are the only adjacent primes that are also adjacent numbers. Your program is given 2 numbers: L and U (1<=L< U<=2,147,483,647), and you are to find the two adjacent primes C1 and C2 (L<=C1< C2<=U) that are closest (i.e. C2-C1 is the minimum). If there are other pairs that are the same distance apart, use the first pair. You are also to find the two adjacent primes D1 and D2 (L<=D1< D2<=U) where D1 and D2 are as distant from each other as possible (again choosing the first pair if there is a tie).InputEach line of input will contain two positive integers, L and U, with L < U. The difference between L and U will not exceed 1,000,000.OutputFor each L and U, the output will either be the statement that there are no adjacent primes (because there are less than two primes between the two given numbers) or a line giving the two pairs of adjacent primes.Sample Input2 1714 17Sample Output2,3 are closest, 7,11 are most distant.There are no adjacent primes.SourceWaterloo local 1998.10.17
题目给出的数据范围很大 但是U-L不超过1e6
可以通过素数筛法把1e5以内的素数先求出
再用1e5内的素数对[L,U]筛(去掉[L,U]中1e5内的素数的倍数)
#include<iostream>#include<stdlib.h>#include<stdio.h>#include<string>#include<vector>#include<deque>#include<queue>#include<algorithm>#include<set>#include<map>#include<stack>#include<time.h>#include<math.h>#include<list>#include<cstring>#include<fstream>//#include<memory.h>using namespace std;#define ll long long#define ull unsigned long long#define pii pair<int,int>#define INF 1000000007#define pll pair<ll,ll>#define pid pair<int,double>const ll N=1e5;bool isprime[N+5];vector<int>prime;void iniPrime(){//筛1e5以内 fill(isprime,isprime+N,true); isprime[1]=false; int k=0; for(int i=2;i<N;++i) if(isprime[i]){ prime.push_back(i); for(ll j=(ll)i*i;j<N;j+=i) isprime[j]=false; }}vector<int>prime2;//[L,U]范围内的素数const int maxlen=1000000+5;bool isprime2[maxlen];void doPrime(ll L,ll U) { prime2.clear(); fill(isprime2, isprime2 + maxlen, true); for (int i = L,end=min(U,N-1); i <= end; ++i)//[L , min(N-1,U)] isprime2[i - L] = isprime[i]; ll tmpL=L; L = max(L, N); if (L <= U) { for (int i = 0; i < prime.size(); ++i) { ll pr = prime[i]; if (pr * pr > U) break; ll s = L / pr, e = U / pr; while (s <= e) {//筛去[L,U]范围内pr的倍数 ll t = s * pr; if (s > 1 && t >= L && t <= U) isprime2[s * pr - L] = false; ++s; } } } L=tmpL; for(ll i=L;i<=U;++i) if(isprime2[i-L]) prime2.push_back(i);}void slove(ll L,ll U){ doPrime(L,U);//求出[L,U]内的素数 if(prime2.size()<2){ puts("There are no adjacent primes."); return ; } int minDt=INF; int minA,minB; int maxDt=0; int maxA,maxB; for(int i=0;i<prime2.size()-1;++i){//找最短距离和最远距离 int j=i+1; if(prime2[j]-prime2[i]<minDt){ minDt=prime2[j]-prime2[i]; minA=prime2[i],minB=prime2[j]; } if(prime2[j]-prime2[i]>maxDt){ maxDt=prime2[j]-prime2[i]; maxA=prime2[i],maxB=prime2[j]; } } printf("%d,%d are closest, %d,%d are most distant.\n", minA,minB,maxA,maxB);}int main(){ //freopen("/home/lu/文档/r.txt","r",stdin); //freopen("/home/lu/文档/w.txt","w",stdout); iniPrime();//提前筛出<1e5的素数 ll L,U; while(~scanf("%lld%lld",&L,&U)){ slove(L,U); } return 0;}
0 0
- POJ 2689 Prime Distance 素数筛法
- POJ 2689 Prime Distance【素数筛法】
- poj 2689 Prime Distance 二次筛素数
- poj 2689 Prime Distance(筛素数)
- POJ 2689 Prime Distance (大素数筛)
- Poj 2689 Prime Distance【素数区间筛】
- POJ 2689 Prime Distance [素数筛+想法]
- !POJ 2689 Prime Distance-卡时间-(素数筛法)
- poj 2689 Prime Distance 筛法/二次筛法/区间素数
- POJ 2689 Prime Distance [筛法选取素数]【数论】
- poj 2689 Prime Distance(大数区间素数筛法)
- poj 2689 Prime Distance 素数
- Poj 2689 Prime Distance(素数筛+二次素数筛)
- poj 2689 Prime Distance 小范围素数筛
- POJ 2689 - Prime Distance 任意区间内筛素数
- POJ 2689 Prime Distance 解题报告(素数筛)
- poj 2689 Prime Distance(大区间筛素数)
- poj 2689 Prime Distance 筛素数加强版
- tcp_client
- bug宝典JAVA篇 Your password has expired
- io
- 简单的ToggleButton
- codeforces 645F (莫比乌斯反演)
- POJ 2689 Prime Distance 素数筛法
- Java Lombok @Data @Builder
- 二极管反向恢复时间
- 库函数与系统调用
- 基于AJAX的文件上传显示进度条实现
- 排序 有待补充
- nodejs目录结构设计
- Java--两大数据类型
- getAttribute()、setAttribute()和getParameter()的联系与区别