Prime Time UVA - 10200

Euler is a well-known matematician, and, among many other things, he discovered that the formula

n 2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which is 41 ∗ 41

Even though this formula doesn’t always produce a prime, it still produces a lot of primes. It’s known

that for n ≤ 10000000, there are 47,5% of primes produced by the formula!

So, you’ll write a program that will output how many primes does the formula output for a certain interval.

Input

Each line of input will be given two positive integer a and b such that 0 ≤ a ≤ b ≤ 10000. You must read until the end of the file.

Output

For each pair a, b read, you must output the percentage of prime numbers produced by the formula in this interval (a ≤ n ≤ b) rounded to two decimal digits.

Sample Input 

0 39

0 40

39 40

Sample Output

100.00

97.56

50.00

题意： 给出多组数据，每组数据包括区间的左右端点。判断区间内数满足n*n+n+41,且所得结果是素数的概率。 

 题解：高精度+素数打表。

 

#include<stdio.h>
#include<string.h>
int num=0;
long long x;
long long s[10010];
long long isprime(long long x)//素数打表
{
    for(int i=2; i*i<=x; i++)
        if(x%i==0)
            return 0;
    return 1;
}
int main()
{
    memset(s,0,sizeof(s));
    for(int i=0; i<10010; i++)
    {
        x=i*i+i+41;
        if(isprime(x)==1)
        {
            num++;
        }
        s[i]=num;
    }
    int a,b;
    double ans=0.0;
    while(~scanf("%d%d",&a,&b))
    {
        ans=(double)(s[b]-s[a-1])/(b-a+1);
        ans=ans*100;
        printf("%.2lf\n",ans+1e-6);
    }
    return 0;

}