forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path104.cpp
More file actions
122 lines (111 loc) · 2.37 KB
/
104.cpp
File metadata and controls
122 lines (111 loc) · 2.37 KB
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <iostream>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <vector>
#include <deque>
#include <set>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long LL;
vector<string> split( const string& s, const string& delim =" " ) {
vector<string> res;
string t;
for ( int i = 0 ; i != s.size() ; i++ ) {
if ( delim.find( s[i] ) != string::npos ) {
if ( !t.empty() ) {
res.push_back( t );
t = "";
}
} else {
t += s[i];
}
}
if (!t.empty() ) {
res.push_back(t);
}
return res;
}
vector<int> splitInt( const string& s, const string& delim =" " ) {
vector<string> tok = split( s, delim );
vector<int> res;
for ( int i = 0 ; i != tok.size(); i++ )
res.push_back( atoi( tok[i].c_str() ) );
return res;
}
LL gcd(LL a,LL b){
return b?gcd(b,a%b):a;
}
inline LL lcm(LL a,LL b){
return a/gcd(a,b)*b;
}
int s2i(string s) {
stringstream ss;
ss << s;
int res;
ss >> res;
return res;
}
string i2s(int n) {
stringstream ss;
ss << n;
string res;
ss >> res;
return res;
}
string add(string a, string b) {
int la = a.length(), lb = b.length();
int add = 0;
REP(i,la) {
int t = a[i] - '0' + b[i] - '0' + add;
b[i] = t % 10 + '0';
add = t / 10;
}
FOR(i,la,lb-1) {
int t = b[i] - '0' + add;
b[i] = t % 10 + '0';
add = t / 10;
}
if (add == 1) b += "1";
return b;
}
bool isok(string s) {
if (s.length() < 9) return false;
int v[10];
memset(v, 0, sizeof(v));
v[0] = 1;
REP(i,9) {
int t = s[i] - '0';
if (v[t] == 1) return false;
v[t] = 1;
}
memset(v, 0, sizeof(v));
v[0] = 1;
REP(i,9) {
int t = s[s.length() - 1 - i] - '0';
if (v[t] == 1) return false;
v[t] = 1;
}
return true;
}
void run() {
string a = "1", b = "1";
int idx = 3;
while (true) {
string c = add(a, b);
if (idx % 10000 == 0) cout << idx << " - " << c << endl;
if (isok(c)) {
cout << idx << endl;
cout << c << endl;
break;
}
a = b, b = c;
++idx;
}
}
int main() {
run();
}