编程介的小学生 2017-04-27 03:25 采纳率: 20.5%
浏览 939
已采纳

Prime Distance

The 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).

Input

Each 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.

Output

For 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 Input

2 17
14 17

Sample Output

2,3 are closest, 7,11 are most distant.
There are no adjacent primes.

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-05-11 15:55
    关注

    http://www.2cto.com/kf/201407/320011.html

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题？

  • Prime Distance
    2017-04-27 03:25
    回答 1 已采纳 http://www.2cto.com/kf/201407/320011.html
  • Prime Friend
    2017-10-29 09:36
    回答 1 已采纳 http://www.acmerblog.com/hdu-3823-prime-friend-6825.html
  • Prime Gap less
    2017-10-06 11:23
    回答 1 已采纳 http://blog.csdn.net/yskyskyer123/article/details/50866452
  • Prime Distance
    2021-02-28 10:53
    迷蒙之雨的博客 题目传送门 Description The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number ... A prime number is a number that
  • Largest prime factor
    2017-11-27 14:14
    回答 1 已采纳 https://www.cnblogs.com/pingge/p/3190003.html
  • Prime Test
    2017-10-13 11:29
    回答 1 已采纳 http://blog.csdn.net/yew1eb/article/details/40833991
  • Prime Path
    2016-11-27 16:33
    回答 1 已采纳 http://www.xuebuyuan.com/757222.html
  • 1619： Prime Distance
    2020-06-20 17:20
    穷源溯流的博客 ll prime[N],num,pos[N]; void init(){ for(ll i=2;i;i++) if(!vis[i]){ prime[++num]=i; for(ll j=i*2;j;j+=i) vis[j]=1; } } int main() { //IOS; init(); ll R,L; while(scanf("%lld%lld",&L,&R)==2){ ms(vis,0)...
  • Calculate Prime S
    2017-08-24 03:33
    回答 2 已采纳 https://stackoverflow.com/questions/12311918/number-of-subsets-of-1-2-3-n-containing-at-least-3-cons
  • Semi-Prime
    2017-03-25 12:33
    回答 2 已采纳 http://blog.csdn.net/sdau20163942/article/details/63687313
  • Prime Distance POJ - 2689 线性筛
    2019-02-18 12:31
    EM-LGH的博客 Prime Distance POJ - 2689 线性筛 一个数 $n$ 必有一个不超过 $\sqrt n$ 的质因子。 打表处理出 $1$ 到 $\sqrt n$ 的质因子后去筛掉属于 $L$ 到 $R$ 区间的素数即可。  Code: #include&lt;...
  • POJ2689Prime Distance(素数筛)
    2022-07-26 14:51
    CSWish的博客 j++) { if(prime[j]>v[i]||prime[j]>n/i)break; v[i*prime[j]] = prime[j]; } } return m; } struct node { int x, y; }; int vis[maxn]; int ans[maxn]; int main() { int l,r; int len = primes(1); int maxx = 0,...
  • Prime Distance（质数距离）
    2020-07-07 16:50
    短尾黑猫的博客 Description The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number ... A prime number is a number that is has n
  • poj 2689 Prime Distance
    2019-09-30 17:32
    banke8061的博客 Prime Distance Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 29401 Accepted: 7556 Description The branch of mathematics called number theory is about properties of numbers. One...
  • 1619： 【例 1】Prime Distance ( 区间素数筛）
    2020-04-17 10:28
    AimerAimerAimer的博客 1619： 【例 1】Prime Distance 【题目描述】 原题来自：Waterloo local，题面详见 POJ 2689 给定两个整数 L,R，求闭区间 [L,R] 中相邻两个质数差值最小的数对与差值最大的数对。当存在多个时，输出靠前的素数对。 ...
  • 1619 例题 Prime Distance(POJ2689 LOJ10197 UVA10140 提高+/省选-) 线性筛 映射关系 0分 筛出区间内质数 超时0分 求任意区间质数的筛子100分
    2021-12-24 10:44
    mrcrack的博客 //质数的左近，右近质数是自己本身 lt[prime[i]]=rt[prime[i]]=prime[i]; for(j=prime[i-1]+1;j<=prime[i]-1;j++) lt[j]=prime[i-1],rt[j]=prime[i];//数j左最近质数lt[j]，右最近质数rt[j] } while(scanf("%d%d",&a...
  • 【poj2689】Prime Distance 素数
    2018-07-30 19:01
    Mininda的博客 int a=(l-1)/prime[i]+1,b=r/prime[i]; for (int j=a;j;j++) if (j>1) f[prime[i]*j-l]=1; } int last=-1,maxx=-inf,minn=inf,x1,y1,x2,y2; for (int i=0;i;i++){ if (!f[i]){ if (last==-1...
  • POJ 2689Prime Distance
    2019-04-30 19:09
    Pegasi_Tio的博客 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) where D1 and D2 are as distant from each other as possible ...
  • prime Distance
    2012-05-11 17:58
    fulai0_0的博客 如果p1和p2(p1)均为素数，且任意整数p（p1）都不是素数，则说素数p1与p2是相邻的，并定义它们之间的距离为d=p2-p1，给定正整数L与U，求出区间【L,U】中距离最小的两个相邻素数c1与c2和距离最大的两个相邻素数D1与D2....
  • 没有解决我的问题, 去提问

悬赏问题

  • ¥15 运筹学排序问题中的在线排序
  • ¥15 关于docker部署flink集成hadoop的yarn，请教个问题 flink启动yarn-session.sh连不上hadoop，这个整了好几天一直不行，求帮忙看一下怎么解决
  • ¥30 求一段fortran代码用IVF编译运行的结果
  • ¥15 深度学习根据CNN网络模型，搭建BP模型并训练MNIST数据集
  • ¥15 C++ 头文件/宏冲突问题解决
  • ¥15 用comsol模拟大气湍流通过底部加热（温度不同）的腔体
  • ¥50 安卓adb backup备份子用户应用数据失败
  • ¥20 有人能用聚类分析帮我分析一下文本内容嘛
  • ¥30 python代码，帮调试，帮帮忙吧
  • ¥15 #MATLAB仿真#车辆换道路径规划