Spoj PRIME1 - Prime Generator
2024-10-21 07:43:00
题意翻译
求给定的两个数之间的素数
Translated by @kaiming
题目描述
Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!
输入输出格式
输入格式:
The input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.
输出格式:
For every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.
输入输出样例
说明
Warning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)
Information
After cluster change, please consider PRINT as a more challenging problem.
//Pro: Spoj PRIME1 - Prime Generator
//求给定的两个数之间的素数 #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std; const long long N=; long long T;
long long cnt;
long long prime[N+];
bool flag[N+]; void init()
{
flag[]=;
long long tmp;
for(long long i=;i<=N;++i)
{
if(!flag[i])
prime[++cnt]=i;
for(long long j=;j<=cnt&&(tmp=i*prime[j])<=N;++j)
{
flag[tmp]=;
if(i%prime[j]==)
break;
}
}
} long long l,r;
bool Flag;
int main()
{
init();
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&l,&r);
for(;l<=r;++l)
{
if(l<=N)
{
if(!flag[l])
{
printf("%d\n",l);
continue;
}
}
else
{
Flag=;
for(long long j=;prime[j]<=sqrt(l)&& !Flag && j<=cnt;++j)
{
if(l%prime[j]==)
Flag=;
}
if(!Flag)
printf("%d\n",l);
}
}
puts("");
}
return ;
}
最新文章
- python splinter
- unix
- Linux Runtime PM介绍【转】
- 字符串还可以这样初始化--uboot篇
- Unity3d 真实的植物渲染
- 中控考勤机-C#操作
- androik_sdk 更新慢问题解决办法。
- ECOS-Ecstore 后台管理地址修改
- C语言根据函数名调用对应的函数
- 关于php中id设置自增后不连续的问题
- Lucene分词停用词库stopwords
- c++中sizeof的用法
- Java继承详解
- 2018-2019-2 《网络对抗技术》Exp1 PC平台逆向破解 20165326
- php 乱整
- react-native实现电影列表
- echarts 实现tooltip双栏效果
- C#Redis集合set
- Fedora29 安装 spring tool suite 4.2
- CSS元素、边框、背景、列表样式
热门文章
- Python Django 协程报错,进程池、线程池与异步调用、回调机制
- serviceBehaviors_dataContractSerializer_maxItemsInObjectGraph 关键**Behavior
- 【转载】 C#中通过Where方法查找出所有符合条件的元素集合
- Java 之 函数式编程
- mybatis异常:nested exception is org.apache.ibatis.builder.BuilderException: Error resolving JdbcType
- 笔谈I帧、P帧、B帧、PTS、DTS(一)
- XnViewer管理浏览照片、图片
- Python七大原则,24种设计模式
- 将excel中的数据转为json格式
- Needham-Schroeder Scyther工具形式化过程