fork download
copy 
  1. /* package whatever; // don't place package name! */
  2.  
  3.     import java.util.*;
  4.     import java.lang.*;
  5.     import java.io.*;
  6.  
  7.     class GFG {
  8.     	public static void main (String[] args) {
  9.     		Scanner sc= new Scanner(System.in);
  10.     		int t=sc.nextInt();
  11.     		while(t!=0)
  12.     		{
  13.     		String s=sc.next();
  14.     		 int n=s.length();
  15.     		 int arr[]=new int[n];
  16.     		 int arr1[]=new int[n];
  17.     		 int flag1=0,x1=0,flag2=0;
  18.     		 for(int i=0;i<n;i++){
  19.     		   arr[i]=s.charAt(i)-48;
  20.     		     arr1[i]=arr[i];
  21.     		     if(arr[i]==9&&flag1==0)
  22.     		     {
  23.     		        x1++; 
  24.     		     }
  25.     		     else {
  26.     		         flag1=1;
  27.     		     }
  28.     		 }
  29.     		 if(n%2==1){
  30.     		     if(n/2+1<=x1)
  31.     		     {
  32.     		       flag2=1;  
  33.     		     }
  34.     		 }
  35.     		 else if(x1>=n/2)
  36.     		         flag2=1;
  37.     		         if(flag2==1)
  38.     		         {
  39.     		          System.out.print(1);
  40.     		          for(int i=0;i<n-1;i++)
  41.     		          System.out.print(0);
  42.     		          System.out.print(1);
  43.     		         }
  44.     		 else {
  45.     		  for(int i=0,j=n-1;i<=j;i++)
  46.     		    {
  47.     		       arr[j--]=arr[i]; 
  48.     		    }
  49.     		     int flag=0;
  50.  
  51.     		     for(int i=0;i<n;i++)
  52.     		    {
  53.     		     if(arr1[i]<arr[i]){
  54.     		         flag=1;
  55.     		         break;
  56.     		     }
  57.     		     else if(arr[i]<arr1[i])
  58.     		            break;
  59.     		    }
  60.  
  61.  
  62.     		   if(n%2==1)
  63.     		   {
  64.     		    if(flag==0)
  65.     		    {
  66.     		     if(arr[n/2]<9)
  67.     		        arr[n/2]=arr[n/2]+1;
  68.     		       else  makearray(arr,n);
  69.     		    }
  70.     		   }
  71.     		   else if(flag==0)
  72.     		   {
  73.  
  74.     		       makearray(arr,n);
  75.     		   }
  76.           for(int i=0;i<n;i++)
  77.            System.out.print(arr[i]);
  78.     		 }
  79.            System.out.println();
  80.  
  81.     		   t--;
  82.     		}
  83.  
  84.     	}
  85.  
  86.  
  87.  
  88.     	public static void makearray(int arr[],int n)
  89.     	{
  90.     	    if(n%2==1)
  91.     	  for(int i=n/2;i>=0;i--){
  92.     	    if(arr[i]==9)
  93.     	    {
  94.     	        arr[i]=0;
  95.     	    }
  96.     	    else {
  97.     	        arr[i]++;
  98.     	        break;
  99.     	    }
  100.     	  }
  101.     	  else
  102.     	  for(int i=n/2-1;i>=0;i--){
  103.     	    if(arr[i]==9)
  104.     	    {
  105.     	        arr[i]=0;
  106.     	    }
  107.     	    else {
  108.     	        arr[i]++;
  109.     	        break;
  110.     	    }
  111.     	  }
  112.     	    for(int i=0,j=n-1;i<=j;i++)
  113.     		    {
  114.     		       arr[j--]=arr[i]; 
  115.     		    }
  116.     	}
  117.     }
Success #stdin #stdout 0.07s 4386816KB
comments (?)
stdin
copy 
2
808
2133
stdout
copy 
818
2222
https://ideone.com/vzqzdI
language:
Java (HotSpot 12)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!