# SGU231-Prime Sum 还是素数

#### 231. Prime Sum

time limit per test: 0.5 sec.
memory limit per test: 4096 KB
input: standard
output: standard

Find all pairs of prime numbers (A, B) such that A<=B and their sum is also a prime number and does not exceed N.

Input
The input of the problem consists of the only integer N (1<=N<=10^6).

Output
On the first line of the output file write the number of pairs meeting the requirements. Then output all pairs one per line (two primes separated by a space).

Sample test(s)

Input

4
Output

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
bool vis[1000007];
void isprime(int n)
{
int k=sqrt(n+0.5);
for(int i=2; i<=k; i++)
{
if(!vis[i])
for(int j=i*i; j<=n; j+=i)
vis[j]=1;
}
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
memset(vis,0,sizeof(vis));
vis[0]=1,vis[1]=1;
int count=0;
isprime(n);
for(int i=2; i<=n-2; i++)
{
if(!vis[i]&&!vis[i+2]&&(i+2)<=n)
count++;
}
printf("%d\n",count);
if(count)
{
for(int i=2; i<=n-2; i++)
{
if(!vis[i]&&!vis[i+2]&&(i+2)<=n)
printf("2 %d\n",i);
}
}
}
return 0;
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：SGU231-Prime Sum 还是素数 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)