-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpellindrme_special.cpp
107 lines (95 loc) · 1.76 KB
/
pellindrme_special.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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int i,n,t,l,m1,m2,mid;
string s;
cin>>t;
while(t--)
{
cin>>s;
l = s.length();
if(l%2==0)
{
m1 = (l/2)-1;
m2 = (l/2);
while(1)
{
if(s[m1]>s[m2] )
{
for(i=0;i<=m1;i++)
s[l-1-i]=s[i];
cout<<s<<"\n";
break;
}
else if(s[m1]<s[m2])
{
s[m1]+=1;
for(i=0;i<=m1;i++)
s[l-1-i]=s[i];
cout<<s<<"\n";
break;
}
else
{
m1--;
m2++;
if(m1<0)
{
cout<<"1";
for(i=1;i<l;i++)
cout<<"0";
cout<<"1\n";
break;
}
}
}
}
else
{
m1 = (l/2)-1;
mid = (l/2)-1;
m2 = (l/2)+1;
while(1)
{
if(s[m1]>s[m2])
{
for(i=0;i<=m1;i++)
s[l-1-i]=s[i];
cout<<s<<"\n";
break;
}
else if(s[m1]<s[m2])
{
if(s[mid+1] == '9')
{
s[mid+1]='0';
s[mid]+=1;
}
else
s[mid+1]+=1;
for(i=0;i<=m1;i++)
s[l-1-i]=s[i];
cout<<s<<"\n";
break;
}
else
{
m1--;
m2++;
if(m1<0)
{
cout<<"1";
for(i=1;i<l;i++)
cout<<"0";
cout<<"1\n";
break;
}
}
}
}
}
return 0;
}