-
Notifications
You must be signed in to change notification settings - Fork 0
/
51.cpp
53 lines (51 loc) · 1.06 KB
/
51.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
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
using namespace std;
const int N = 1000001;
int Prime[N], cut = 0;
bool isnotprime[N];
void Liner_prime_list ()
{
isnotprime[1] = 1;
for (int i = 2; i < N ;i ++)
{
if (!isnotprime[i]) Prime[cut ++] = i;
for (int j = 0; j < cut && Prime[j] * i < N; j ++)
{
isnotprime[i * Prime[j]] = 1;
if (i % Prime[j] == 0) break;
}
}
}
inline bool Judge (int x)
{
int a[11], b[11], digit = 0, get = x, num = 0;
while (get) a[digit ++] = get % 10, get /= 10;
for (int i = 1; i < (1 << 5) ; i ++)
{
set <int> s; s.insert(x);
for (int j = 0; j < 10; j ++)
{
for (int k = 0; k < digit; k ++)
b[k] = a[k];
for (int k = 0; k < 5; k ++)
if (i & (1 << k))
b[k + 1] = j;
for (int k = digit - 1; k >= 0; k --)
num = num * 10 + b[k];
if (!isnotprime[num]) s.insert(num);
}
if (*s.begin() == x && s.size() == 8) return 1;
}
return 0;
}
int main()
{
ios::sync_with_stdio(false);
Liner_prime_list ();
for (int i = 100001; i < N ; i += 2)
if (!isnotprime[i] && Judge (i)) {
cout << i << endl;
break;
}
return 0;
}