#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool isprime(int n) //判断是不是素数
{
if (n == 2)
return true;
if (n % 2 == 0)
return false;
bool flag = true;
for (int i = 3; i <= sqrt(n); i += 2)
{
if (n%i == 0)
{
flag = false;
}
}
return flag;
}
int main()
{
int n,m;
vector<int> ivec;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> m;
ivec.push_back(m);
}
sort(ivec.begin(), ivec.end());
int num = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
int min = ivec[i];
int max = ivec[j];
for (int k = min; k < max; ++k)
{
if (isprime(k))
{
++num;
}
}
}
}
cout << num << endl;
system("pause");
}
搜狗笔试题:输入任意个偶数,找任意两个偶数之间的素数的个数的总和
最新推荐文章于 2016-09-16 13:24:55 发布