ayit609第七周训练c题

hdy403

于 2020-04-01 21:42:03 发布

阅读量152

点赞数

本文链接：https://blog.csdn.net/m0_46628834/article/details/105256381

版权

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


#include <stdio.h>
#include<math.h>
#include <string.h>
#include<algorithm>
using namespace std;
int dis[100010];
int f(int x)
{
	int j;
	for(j=2;j*j<=x;j++)
	{
		if(x%j==0)
		return 0;
	}
	return 1;
}
int main()
{
	int i;
	for(i=0;i<=10000;i++)
	{
		dis[i]=f(i*i+i+41);
	}
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		int k;
		double sum=0;
		for(k=n;k<=m;k++)
		sum+=dis[k];
		printf("%.2lf\n",(sum*1.0)/(m-n+1)*100+1e-8);
	}
	return 0;
}

题意 n^2 + n +41 这个公式出来的数是素数的概率

注意的是可以先统计各个范围的素数的个数，然后再进行计算

输出的时候应该是四舍五入没有这个就不对了小心一下做的时候应该小心一下