1007. 素数对猜想 (20)
时间限制
400 ms
内存限制
32000 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
让我们定义 dn 为:dn = pn+1 - pn,其中 pi 是第i个素数。显然有 d1=1 且对于n>1有 dn 是偶数。“素数对猜想”认为“存在无穷多对相邻且差为2的素数”。
现给定任意正整数N (< 105),请计算不超过N的满足猜想的素数对的个数。
输入格式:每个测试输入包含1个测试用例,给出正整数N。
输出格式:每个测试用例的输出占一行,不超过N的满足猜想的素数对的个数。
输入样例:20输出样例:
4
#include<iostream>
#include<vector>
using namespace std;
bool prime(vector<int> data,int i);
int main()
{
int number;
cin>>number;
int counter;
vector<int> data;
data.push_back(2);
typedef vector<int>::iterator iter;
for (int i = 3;i <= number; i++)
{
if (prime(data, i))
{
data.push_back(i);
}
}
counter = 0;
for(iter start = data.begin(); start != data.end() - 1; start++)
{
if(2 == *(start + 1) - *(start))
{
counter++;
}
}
cout<<counter<<endl;
return 0;
}
bool prime(vector<int> data, int n)
{
for (int i = 0; data[i] * data[i] <= n; i++)
{
if (0 == n % data[i])
{
return false;
}
}
return true;
}
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
bool prime(int i);
int main()
{
int number;
cin>>number;
int counter;
vector<int> data;
data.push_back(2);
typedef vector<int>::iterator iter;
for (int i = 3;i <= number; i++)
{
if (prime(i))
{
//cout<<i<<" ";
data.push_back(i);
}
}
counter = 0;
for(iter start = data.begin(); start != data.end() - 1; start++)
{
if(2 == *(start + 1) - *(start))
{
counter++;
}
}
cout<<counter<<endl;
return 0;
}
bool prime(int n)
{
int i, bound;
bound = sqrt(n);
for (i = 2; i <= bound; i++)
{
if (0 == n % i)
{
return false;
}
}
return true;
}
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
bool prime(int i);
int main()
{
int number;
cin>>number;
int counter;
vector<int> data;
data.push_back(2);
typedef vector<int>::iterator iter;
for (int i = 3;i <= number; i++)
{
if (prime(i))
{
//cout<<i<<" ";
data.push_back(i);
}
}
counter = 0;
for(iter start = data.begin(); start != data.end() - 1; start++)
{
if(2 == *(start + 1) - *(start))
{
counter++;
}
}
cout<<counter<<endl;
return 0;
}
bool prime(int n)
{
int i, bound;
if ( 0 == n % 2)
return 2 == n;
if (0 == n % 3)
return 3 == n;
if (0 == n % 5)
return 5 == n;
bound = sqrt(n);
for (i = 7; i <= bound; i+=2)
{
if (0 == n % i)
{
return false;
}
}
return true;
}