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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 151515
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
unsigned ll concat(string s, unsigned ll n) {
string res = "";
while(res.length() < n) res += s;
return res.length() == n ? stoll(res) : 0;
}
unsigned ll solve(string s) {
unsigned ll n = s.length(), res = stoll(string(n - 1, '9'));
unsigned ll k = stoll(s);
string prefix = "";
for(ll i = 0; i < n - 1; i++) {
prefix.push_back(s[i]);
if(n % prefix.length() != 0) continue;
unsigned ll A = concat(prefix, n);
if(A <= k) res = max(res, A);
unsigned ll B = concat(to_string(stoll(prefix) - 1), n);
if(B <= k) res = max(res, B);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
cin>>tc;
for(ll i = 1; i <= tc; i++) {
string s;
cin>>s;
cout<<solve(s)<<endl;
}
return 0;
}
|
