nyist-基础语言-题目24(素数距离问题)

这道题目还是蛮好玩的,运用到了素数的筛选法,对于自己的复习还是不错的,

自己有很多细小错误的方面还是没有记住,

看代码:

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <string>
#include <algorithm>
#define Maxn 1000011

using namespace std;

bool p[Maxn];

void Init ()
{
	for (int i = 1; i < Maxn; i++)
	{
		p[i] = 1;
	}
	p[1] = 0;
	for (int i = 4; i < Maxn; i += 2)
	{
		p[i] = 0;
	}
	for (int i = 3; i < sqrt (Maxn); i += 2)
	{
		int k = i << 1;
		for (int j = i * i; j < Maxn; j += k)
		{
			p[j] = 0;
		}
	}
}

void Solve (int  x)
{
	if (p[x])
	{
		cout << x << " " << "0" << endl;
	}
	else
	{
		int temp = x;
		int flag = x;
		while (!p[temp])
		{
			temp--;
		}
		while (!p[flag])
		{
			flag++;
		}
		if (x - temp <= flag - x)
		{
			cout << temp << " " << x - temp << endl;
		}
		else
		{
			cout << flag << " " << flag - x << endl;
		}
	}
}


int main ()
{
	int  N;
	Init ();
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		int a;
		cin >> a;
		Solve (a);
	}
//	system ("pause");
	return 0;
}