Main/C++/2019/S2.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

#include <bits/stdc++.h>
using namespace std;

bool is_prime(int n);

int main()
{
    int T, N;
    cin >> T;
    for (int i = 0; i < T; i++)
    {
        cin >> N;
        int a=2,b;
        while (true)
        {
            if (is_prime(a))
            {
                b = 2 * N - a;

                if (is_prime(b))
                {
                    cout << a << " " << b << endl;
                    break;
                }
            }
            a++;


        }
    }
    return 0;
}

bool is_prime(int n)
{
    if (n == 2)
        return true;
    for (int i = 2; i <= 1+sqrt(n); i++)
    {
        if (n % i == 0)
            return false;
    }
    return true;
}