Spoj PRIME1 - Prime Generator

题意翻译

求给定的两个数之间的素数

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.

输入输出样例

输入样例#1： 复制

2
1 10
3 5

输出样例#1： 复制

2
3
5
7

3
5

说明

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 ;
}