fork download
copy 
  1.  
  2.  
  3. /**
  4.  *
  5.  * @author Nirjhar
  6.  */
  7.  
  8. import java.io.*;
  9. class c2 {
  10.     public static void main(String args[])throws IOException
  11.     {
  12.         BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
  13.         int t= Integer.parseInt(br.readLine());
  14.  
  15.         while(t>0)
  16.         {    
  17.             String snum=br.readLine();
  18.             int l=snum.length();
  19.             int num[]= new int[l+1];
  20.             for(int i=1;i<num.length;i++)
  21.             {
  22.                 num[i]=snum.charAt(i-1)-48;
  23.             }
  24.             l=num.length;
  25.             int pos=-1;
  26.             int i=l-1;
  27.             while(true)
  28.             {
  29.                 if(num[0]!=0)
  30.                 {
  31.                     if(num[i]==num[l-i-1])
  32.                         i--;
  33.  
  34.                     else if(num[i]<num[l-i-1])
  35.                     {
  36.                         num[i]=num[l-i-1];
  37.                         i--;
  38.                     }
  39.                     else if(num[i]>num[l-i-1])
  40.                     {
  41.                         num[i]=num[l-i-1];
  42.  
  43.                         add(num,i-1);
  44.  
  45.  
  46.                     }
  47.                 if(isPal(num))
  48.                 {
  49.                     for(int k=1;k<num.length;k++)
  50.                     {
  51.                         if(k==0 && num[0]!=0)
  52.                             System.out.print(num[k]);
  53.                         else if(k!=0)
  54.                             System.out.print(num[k]);
  55.                     }
  56.                     System.out.println();  
  57.                     break;
  58.  
  59.                 }
  60.                     if(i<0)
  61.                        break;
  62.                 }
  63.                 else
  64.                 {
  65.                     if(num[i]==num[l-i])
  66.                         i--;
  67.  
  68.                     else if(num[i]<num[l-i])
  69.                     {
  70.                         num[i]=num[l-i];
  71.                         i--;
  72.                     }
  73.                     else if(num[i]>num[l-i])
  74.                     {
  75.                         num[i]=num[l-i-1];                        
  76.                         add(num,i-1);
  77.                     }
  78.                 if(isPal(num))
  79.                 {
  80.                     for(int k=1;k<num.length;k++)
  81.                     {
  82.                         if(k==0 && num[0]!=0)
  83.                             System.out.print(num[k]);
  84.                         else if(k!=0)
  85.                             System.out.print(num[k]);
  86.                     }
  87.                     System.out.println();  
  88.                     break;
  89.  
  90.                 }
  91.                     if(i<1)
  92.                        break;
  93.                 }
  94.                 }
  95.  
  96.                 t--;
  97.             }
  98.         }
  99.  
  100.     public static void add(int num[], int i)
  101.     {
  102.         while(true){
  103.         num[i]=(num[i]+1);
  104.  
  105.         if(num[i]==10 && i>=0)
  106.         {
  107.             num[i]=0;
  108.             i--;
  109.         }
  110.         else
  111.             return;
  112.         }
  113.  
  114.  
  115.     }
  116.     private static boolean isPal(int num[]) 
  117.     {        
  118.         if(num[0]!=0)
  119.         {
  120.             int l=num.length;
  121.             for(int i=0;i<=l/2;i++)
  122.             {
  123.                 if(num[i]!=num[l-i-1])
  124.                     return false;
  125.             }
  126.         }
  127.         else
  128.         {
  129.             int l=num.length;
  130.             for(int i=1;i<=(l+1)/2;i++)
  131.             {
  132.                 if(num[i]!=num[l-i])
  133.                     return false;
  134.             }
  135.         }
  136.         return true;
  137.     }
  138. }
  139.  
  140.  
Runtime error #stdin #stdout #stderr 4.99s 380352KB
comments (?)
stdin
copy 
1
6854651546546516549681651685165168516516516516516516546516516851651
stdout
copy 
Standard output is empty
stderr
copy 
/spoj/java_run: line 9:  2035 CPU time limit exceeded /opt/$VER/bin/java -client -Xbatch -Dfile.encoding=UTF-8 -jar tested.zip
https://ideone.com/xlF1U3
language:
Java (12.0.1)
created:
9 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!