lightoj 1259 Goldbach`s Conjecture
2017-08-15 16:11
106 查看
解题思路:按照常规暴力的话,结果肯定是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
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).
Output
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
Sample Input
2
6
4
Sample Output
Case 1: 1
Case 2: 1
Hint
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;
}
这道题还有一个需要注意到,开数组的时候用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
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).
Output
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
Sample Input
2
6
4
Sample Output
Case 1: 1
Case 2: 1
Hint
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;
}
相关文章推荐
- 1.m分解阶乘之和
- 2.几种递推数
- 3.欧拉函数
- 4.快速幂模m算法
- 5.扩展欧几里得&&中国剩余定理
- 6.数论_web
- Project Euler Problem 387 - Harshad Numbers - 深度优先
- 编程之美2015初赛A
- [容斥+莫比乌斯]bzoj2440_完全平方数
- 雅克比算法 JAVA实现
- 莫比乌斯反演
- HDU 3388 与m,n 互质的第k个整数
- BZOJ 2186 沙拉公主的困惑 逆元+素数筛+欧拉函数
- 数论题集
- 原根
- 阶与原根学习笔记
- HDU 1299 Diophantus of Alexandria
- Leftmost Digit(HDU 1060)
- Rightmost Digit(HDU 1061)
- ZS and The Birthday Paradox