lightoj 1259 Goldbach`s Conjecture
来源:互联网 发布:java项目视频20套 编辑:程序博客网 时间:2024/05/29 10:01
解题思路:按照常规暴力的话,结果肯定是Memory Limit,所以这道题可以用素数筛先把素数找出来,记录在一个数组里面,等用的时候直接可以用。见代码吧!!!
这道题还有一个需要注意到,开数组的时候用bool型,因为bool型占一个字节,而int占四个字节
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, ...
#include<stdio.h>#include<string.h>#include<vector>using namespace std;bool vis[10000005];vector<int> v;void get_prime(){ memset(vis,false,sizeof(vis)); vis[1]=true; for(int i = 2; i<=10000000; i++) { int t=10000000/i; for(int j=2;j<=t;j++) vis[i*j]=true; } for(int i=2;i<=10000000;i++) if(!vis[i]) v.push_back(i);}int main(){ get_prime(); int T,t=1; scanf("%d",&T); while(T--) { int n,ans=0; scanf("%d",&n); for(int i=0;v[i]<=n/2;i++) { if(!vis[n-v[i]]) ans++; } printf("Case %d: %d\n",t++,ans); } return 0;}
- lightOJ 1259 Goldbach`s Conjecture
- LightOJ - 1259 Goldbach`s Conjecture
- LightOJ 1259 Goldbach`s Conjecture
- LightOJ 1259 Goldbach`s Conjecture
- LightOJ - 1259 Goldbach`s Conjecture
- LightOJ 1259 Goldbach`s Conjecture
- LightOJ 1259 Goldbach`s Conjecture
- Goldbach`s Conjecture LightOJ 1259
- Goldbach`s Conjecture LightOJ 1259
- lightoj 1259 Goldbach`s Conjecture
- LightOJ 1259 Goldbach`s Conjecture
- Goldbach`s Conjecture LightOJ
- Goldbach`s Conjecture LightOJ
- 【哥德巴赫猜想】LightOJ Goldbach`s Conjecture 1259
- LightOJ 1259 Goldbach`s Conjecture(数论)
- lightoj 1259 - Goldbach`s Conjecture 【素数筛】
- LightOj 1259-Goldbach`s Conjecture(素数打表)
- LightOJ 1259 Goldbach`s Conjecture(证明哥德巴赫猜想)
- Android通用网络操作的封装:HttpUrlConnection 和 OkHttp [学习笔记]
- 给大家诚意推荐几款Mac必备软件
- AJAX 解析
- 内心痛苦
- Spring中ApplicationContext和beanfactory区别
- lightoj 1259 Goldbach`s Conjecture
- CSS3多列布局(columns)的用法
- 标签设置小手
- 算法学习笔记4-动态规划-背包问题
- Nginx 配置文件 nginx.conf 详解
- hdu 6124 Euler theorem (多校联赛)
- 欢迎使用CSDN-markdown编辑器
- Web前端学习路线与学习方式
- SDCardUtils