ACM 素数距离问题 现在给出你一些数，要求你写出一个程序，输出这些整数相邻最近的素数，并输出其相距长度。如果左右有等距离长度素数，则输出左侧的值及相应距离

//#include "stdafx.h"
#include <iostream>
#include <algorithm> 
using namespace std;

bool isSuNumber(int number) {
    if (number == 1 || number == 0) {
        return false;
    }
    for (int i = 2; i <= sqrt(number); i++) {
        if (number % i == 0) {
            return false;
        }
    }
    return true;
}
int main() {
    int n = 0;
    cin >> n;
    while (n-- > 0) {
        int number;
        cin >> number;
        int a = number;
        while (isSuNumber(a) != true) {//number左边
            a--;
        }
        int b = number;
        while (isSuNumber(b) != true) {//number右边
            ++b;
        }
        if ((number - a)<=(b - number))
            cout << a << ' ' << (number - a) << endl;
        else if ((number - a)>(b - number))
            cout << b << ' ' << (b - number) << endl;
    }

    return 0;
}