Prime Time

Euler is a well-known matematician, and, among many other things, he discovered that the formula n2 +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>
#include<algorithm>
using namespace std;
int s[10011];
int cn(long long x)
{
    if(x<=1) return 0;
    if(x==2||x==3) return 1;
    if(x%6!=1&&x%6!=5) return 0;
    for(long long i=5; i*i<=x; i+=6)
        if(x%i==0||x%(i+2)==0) return 0;
    return 1;
}
void cm()
{
    s[0]=1;
    for(int i=1; i<10011; i++)
    {
        long long l=i*i+i+41;
        if(cn(l))
            s[i]=s[i-1]+1;
        else
            s[i]=s[i-1];
    }
}
int main()
{
    int a,b;
    cm();
    while(~scanf("%d%d",&a,&b))
    {
        int k=s[b]-s[a]+cn(a*a+a+41);
        double h=k*1.0/(b-a+1)*100;
        printf("%.2lf\n",h+1e-8);
    }
    return 0;
}