-
Notifications
You must be signed in to change notification settings - Fork 0
/
smithnumbers.cpp
89 lines (76 loc) · 1.41 KB
/
smithnumbers.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <map>
#include <sstream>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> pii;
bool pri[100005];
vector<int> p;
int d(ll n){
int ret = 0;
while(n){
ret+=n%10;
n/=10;
}
return ret;
}
int com(ll n){
int ret = 0;
for(auto i:p){
if(n<i)
break;
while(n%i==0){
n/=i;
ret += d(i);
}
}
if(n>1)
ret += d(n);
return ret;
}
bool check(ll n){
for(int i=2;i<=sqrt(n);i++)
if(n%i==0)
return false;
return true;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
p.clear();
memset(pri,true,sizeof(pri));
pri[0]=false; pri[1]=false;
for(int i=2;i<100005;i++){
if(pri[i]){
p.push_back(i);
for(int j=i+i;j<100005;j+=i)
pri[j]=false;
}
}
int n;
cin>>n;
while(n--){
ll tmp;
vector<int> mod;
cin>>tmp;
while(true){
tmp++;
if(check(tmp))
continue;
if(d(tmp)==com(tmp)){
cout<<tmp<<'\n';
break;
}
}
}
return 0;
}