Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef unsigned long long int ull;
- typedef long long int ll;
- typedef vector<int> vi;
- typedef vector<ll> vll;
- typedef vector<vi> vvi;
- typedef pair<int,int > pii;
- typedef vector< pii > vpii;
- typedef set<int> sti;
- #define sc scanf
- #define pf printf
- #define sci(n) scanf("%d",&n)
- #define scii(n,m) scanf("%d %d",&n,&m)
- #define scl(n) scanf("%lld",&n)
- #define scd(n) scanf("%lf",&n)
- #define scs(s) scanf("%s",s)
- #define pfi(n) printf("%d",n)
- #define pfl(n) printf("%lld",n)
- #define pff(n) cout<<n
- #define line printf("\n")
- #define spc printf(" ")
- #define clr(a,x) memset(a,x,sizeof(a))
- #define loop(i,x,y) for(int i=int(x); i<=int(y); i++)
- #define rloop(i,y,x) for(int i=int(y); i>=int(x); i--)
- #define cspf(i) printf("Case %d: ", i)
- #define vout(v) for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
- #define pb push_back
- #define mp make_pair
- #define ff first
- #define ss second
- #define all(v) v.begin(),v.end()
- #define rall(v) v.rbegin(),v.rend()
- #define read() freopen("input.txt", "r", stdin)
- #define write() freopen("output.txt", "w", stdout)
- #define fastIO() ios_base::sync_with_stdio(false); cin.tie(NULL);
- /// Constants
- #define eps 1e-9
- #define PI acos(-1.0) // 3.1415926535897932
- #define MAX 1e9
- #define MOD 1000007
- ll GCD(ll a, ll b) { return b == 0 ? a : GCD(b , a % b); }
- ll LCM(ll a, ll b) { return a * (b/GCD(a, b)); }
- char s[1000005];
- int main()
- {
- int t;
- sci(t);
- loop(ca,1,t){
- scanf("%s",s);
- cspf(ca);
- bool f=false;
- int a,b;
- int ln=strlen(s);
- int k=(ln-1)/2;
- if(ln%2) a=k-1;
- else a=k;
- b=k+1;
- for(int i=a,j=b;i>=0;i--,j++){
- if(s[i]<s[j]) break;
- else if(s[i]>s[j]){
- f=true;
- break;
- }
- }
- if(f){
- for(int i=0,j=ln-1;i<j;i++,j--) s[j]=s[i];
- printf("%s\n", s);
- }
- else{
- f=false;
- int x=0;
- for(int i=k;i>=0;i--){
- if(s[i]=='9') continue;
- s[i]=s[i]+1;
- x=i;
- f=true;
- break;
- }
- if(f){
- for(int i=x+1;i<=k;i++) s[i]='0';
- for(int i=0,j=ln-1;i<j;i++,j--) s[j]=s[i];
- printf("%s\n", s);
- }
- else{
- pf("1");
- for(int i=1;i<ln;i++) pf("0");
- pf("1\n");
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement