LOJ - 1197 - 《Help Hanzo》【区间素数】

2 篇文章 0 订阅

1197 - Help Hanzo

Amakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The reason behind this is he had a little problem with Hanzo Hattori, the best ninja and the love of Nakururu. After hearing the news Hanzo got extremely angry. But he is clever and smart, so, he kept himself cool and made a plan to face Amakusa.

Before reaching Amakusa's castle, Hanzo has to pass some territories. The territories are numbered as a, a+1, a+2, a+3 ... b. But not all the territories are safe for Hanzo because there can be other fighters waiting for him. Actually he is not afraid of them, but as he is facing Amakusa, he has to save his stamina as much as possible.

He calculated that the territories which are primes are safe for him. Now given a and b he needs to know how many territories are safe for him. But he is busy with other plans, so he hired you to solve this small problem!

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case contains a line containing two integers a and b (1 ≤ a ≤ b < 231, b - a ≤ 100000).

Output

For each case, print the case number and the number of safe territories.

Sample Input

Output for Sample Input

3

2 36

3 73

3 11

Case 1: 11

Case 2: 20

Case 3: 4



【实现代码】

#include<cstdio>
#include<cmath>
#define maxn 100005
bool IsPrime[maxn];
void SegmentPrime(int a,int b)
{
    int x=sqrt(b);
    int d=b-a+1;
    for(int i=0;i<d;i++)IsPrime[i]=(a+i)%2;
    for(int i=3;i<=x;i+=2)
    {
        if(i>=a&&!IsPrime[i-a])continue;
        int j=(a/i)*i;
        if(j<a)j+=i;
        if(j==i)j+=i;
        j=j-a;
        for(;j<d;j+=i)IsPrime[j]=0;
    }
    if(a==1)IsPrime[0]=0;
    if(a<=2)IsPrime[2-a]=1;
}
int main()
{
    int T;
    scanf("%d",&T);
    for(int t=1;t<=T;t++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        SegmentPrime(a,b);
        int sum=0;
        for(int i=0;i<=b-a;i++)if(IsPrime[i])sum++;
        printf("Case %d: %d\n",t,sum);
    }
    return 0;
}
CPU     MEMORY 
0.236 1196      


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值