[ÇóÖú]Ææ¹ÖµÄÎÊÌâ,¾¿¾¹ÊÇÄĶù²»¶Ô.

~~¾«ÁéС½ã$

//ÕÒÔÚ10000ÄÚµÄÖÊËØÀïµÈ²î×î´óµÄµÈ²îÊýÁÐ Èç3 5 7²îΪ2
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(int argc, char* argv[])
{
const int SIZE = 10000;
int num[SIZE+1]; //Ò»¸öÕ¤À¸,¼´num[0];
num[0]=0;
num[1]=0;
for(int m=2;m<=SIZE;m++) //set all the num 1
num[m]=1;
int pp=sqrt(SIZE)+1;
for (int a=2;a!=pp;a++)
for(int b=2;b<=sqrt(a);b++) //find the prime number in sqrt(SIZE) and set others 0
if(a%b==0)
{
num[a]=0;
break;
}
for(int i=1;i!=pp;i++) // find tne prime number in SIZE and set them 1
{
if(num[i]==0)
continue;

for (int j=2;j<=SIZE / i;j++)
num[i*j]=0;
}
vector<int> PN;

for(int n=1;n<SIZE;n++) //save the prime number in vector PN
if(num[n]==1)
PN.push_back(n);
vector<int>::iterator Pb=PN.begin();
vector<int>::reverse_iterator Pe=PN.rbegin();
int aa[4]={1,1,1,1};
vector<int> L(aa,aa+4);
int abc=PN.size()/2;

for (int N=0;N < abc;N++,Pb++)
{
for (int M=0;M < abc;M++,Pe++)
{

L[3]=(*Pb+*Pe)/2;
if(f