2020-10-26

素数距离问题c++

#include< iostream>
using namespace std;
int main()
{
int M, N, i, k, isprime, t, A, B;
cin >> N;
for (i = 1; i <= N; i++)
{
cin >> M;
isprime = 1;
for (k = M - 1; k > 1; k- -)
if (M % k == 0)
{
isprime = 0;
break;
}
if (isprime)
cout << M << " " << “0” << endl;
else
{
for (t = 1; t < (M - 1); t++)
{
A=M-t;
isprime = 1;
for (k = M - t - 1; k > 1; k- -)
if (A % k == 0)
{
isprime = 0;
break;
}
if (isprime)
{
cout << A << " " << t << endl;
break;
}
else
{
B=M+t;
isprime = 1;
for (k = M + t - 1; k > 1; k–)
if (B % k == 0)
{
isprime = 0;
break;
}
if (isprime)
{
cout << B << " " << t << endl;
break;
}
}
}
}
}
return 0;
}