#include <iostream>
#include <cmath>
using namespace std;
void insertionSort(int list[], int arraySize)
{
for (int i = 1; i < arraySize; i++)
{
int currentElement = list[i];
int k;
for (k = i - 1; k >= 0 && list[k] > currentElement; k--)
list[k + 1] = list[k];
list[k + 1] = currentElement;
}
}
bool isprime(int a)
{
for (int i = 2; i <= sqrt(a); i++)
if (a%i == 0) return false;
return true;
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[10001];
int N, K;
int kmax, kmin;
int i;
int cha;
cin >> N >> K;
for (i = 0; i < N; i++)
cin >> a[i];
insertionSort(a, N);
kmax = a[N - K];
kmin = a[K - 1];
cha = kmax - kmin;
if (isprime(cha))
cout << "YES" << endl;
else
cout << "NO" << endl;
cout << cha << endl;
return 0;
}
这是1001题,有人可以帮忙看一下吗?谢谢了。
#include <cmath>
using namespace std;
void insertionSort(int list[], int arraySize)
{
for (int i = 1; i < arraySize; i++)
{
int currentElement = list[i];
int k;
for (k = i - 1; k >= 0 && list[k] > currentElement; k--)
list[k + 1] = list[k];
list[k + 1] = currentElement;
}
}
bool isprime(int a)
{
for (int i = 2; i <= sqrt(a); i++)
if (a%i == 0) return false;
return true;
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[10001];
int N, K;
int kmax, kmin;
int i;
int cha;
cin >> N >> K;
for (i = 0; i < N; i++)
cin >> a[i];
insertionSort(a, N);
kmax = a[N - K];
kmin = a[K - 1];
cha = kmax - kmin;
if (isprime(cha))
cout << "YES" << endl;
else
cout << "NO" << endl;
cout << cha << endl;
return 0;
}
这是1001题,有人可以帮忙看一下吗?谢谢了。