LightOJ
来源:互联网 发布:淘宝名字怎么改 编辑:程序博客网 时间:2024/05/27 09:45
Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:
Every even integer, greater than 2, can be expressed as the sum of two primes [1].
Now your task is to check whether this conjecture holds for integers up to 107.
Input starts with an integer T (≤ 300), denoting the number of test cases.
Each case starts with a line containing an integer n (4 ≤ n ≤ 107, n is even).
For each case, print the case number and the number of ways you can express n as sum of two primes. To be more specific, we want to find the number of (a, b) where
1) Both a and b are prime
2) a + b = n
3) a ≤ b
2
6
4
Case 1: 1
Case 2: 1
1. An integer is said to be prime, if it is divisible by exactly two different integers. First few primes are 2, 3, 5, 7, 11, 13, ...
题意:给你一个数k 找出有多少个素数对(素数a+素数b=k )a可以等于b#include<cstdio>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>#include<map>#include<vector>#include<queue>#define LL long long//const LL INF=1e18;const int INF=1e7+5;using namespace std;int su[1000000],cnt,n,k;bool a[INF];void aa(){ int cnt=1; memset(a,1,sizeof(a)); a[0]=a[1]=0; for(int i=2;i<INF;i++) { if(a[i]) su[cnt++]=i; for(int j=1;j<cnt&&su[j]*i<INF;j++) a[su[j]*i]=0; }}int main(){ aa(); int o=1; int ans; scanf("%d",&n); while(n--) { ans=0; scanf("%d",&k); int k1=k/2; for(int i=1;su[i]<=k1;i++) { if(a[k-su[i]]) ans++; } printf("Case %d: %d\n",o++,ans); }}
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- [LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- Synchronized的基本使用
- 配置Maven阿里云仓库和添加依赖时搜索为空问题解决方案
- 二维码
- MTK Android 平台开发之旅
- yii 安装
- LightOJ
- Android 自定义Button波纹效果
- paramiko(挖坑)
- Nodejs TimeZone 相关设置(修改时区)
- 流式布局
- Android手机的USB转串口开发
- 《TCP-IP详解卷3:TCP 事务协议、HTTP、NNTP和UNIX域协议》【PDF】下载
- jetson TX2 使用筆記(Jetson-inference使用)
- java开发必会的Linux命令