Codes/696B.cpp at main · Bernini0/Codes · GitHub

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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
vector <int>prime;
void bitwiseseive(int n){
    int arr[(n/64)+1];
    memset(arr,0,sizeof(arr));
    for (int i = 3; i*i < n; i+=2)
    {
        if(!(arr[i/64] & (1 << ((i >> 1)& 31)))){
            for (int j = i*i; j < n; j+= 2*i)
            {
                arr[j/64] |= (1 << ((j >> 1) & 31));
            }

        }
    }

    prime.push_back(2);
    for (int i = 3; i < n; i+=2)
    {
        if(!(arr[i/64] & (1<< ((i >> 1)&31)))){
            prime.push_back(i);
        }
    }

}
vector <int>factor[10000+1];
void factory(int n)
{
    for (int i = 1; i <= sqrt(n); i++)
    {
        if(n%i==0){
            factor[n].push_back(i);
            if(n/i!=i){
                factor[n].push_back(n/i);
            }
        }
    }


}
int main()
{
    bitwiseseive(10000000);
    // for (int i = 3; i <= 10000; i++)
    // {
    //     factory(i);
    //     sort(factor[i].begin(),factor[i].end());
    // }
    // for (int i = 0; i < factor[6].size(); i++)
    // {
    //     printf("%d ",factor[6][i]);
    // }
    // printf("\n");
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int d;
        scanf("%d", &d);
        int d2 = 2*d+1;
        int j = lower_bound(prime.begin(),prime.end(),d+1)-prime.begin();
        int k = lower_bound(prime.begin(),prime.end(),prime[j]+d)-prime.begin();
        j = prime[j];
        k = prime[k];
        long long int ans = (long long int)j*(long long int)k;
        printf("%lld\n",ans);
    }

}