Problem:
Small, Large, or Equal

Write a program which prints small/large/equal relation of given two integers a and b.

Input

Two integers a and b separated by a single space are given in a line.

Output

For given two integers a and b, print

a < b

if a is less than b,

a > b

if a is greater than b, and

a == b

if a equals to b.

Constraints

-1000 ≤ a, b ≤ 1000

Sample Input 1

1 2

Sample Output 1

a < b

Sample Input 2

4 3

Sample Output 2

a > b

Sample Input 3

5 5

Sample Output 3

a == b

Solution in JAVA (judge verdict: Wrong Answer)


import java.io.*;
public class Main {

    public static void main(String[] args) throws IOException  {
        
    	// ?¨??????\??????????????????????????????
    	int c;
        int keta = 0;
        // int hairetsu_keta[] = new int[4]; hairetsu_keta[0] = 0;hairetsu_keta[1] = 0;hairetsu_keta[2] = 0;hairetsu_keta[3] = 0;
        int hairetsu_keta[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; // ???????????¨???????????¨????????£????????????
        int j = 0;
        int deru = 0;         
        // int hairetsu[] = new int[4]; hairetsu[0] = 0; hairetsu[1] = 0; hairetsu[2] = 0; hairetsu[3] = 0;
        int hairetsu[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};//???????????¨???????????¨????????£???????????????????????????????????°????¢????????????????20???
        
        int i= 0;
        while ((c = System.in.read()) != -1  )
        {
        	// System.out.println(c);
        	if ( c > 47 && c < 58) // suuji ga kita
       	    {
        		hairetsu[i] = c-48;
        		i++;
        		keta++;
                 
        		//  System.out.println("Qurege_no_kazu_keta_hantaikara:" + Qurage_no_kazu);
       	    }
        	if ( c == 10) // return ga kita
        	{
        		hairetsu_keta[j] = keta;
        		deru++; //return ga  kitara while wo deru
        		j++; // damekamo
        	}
        	if ( c == 32) //space ga kita
        	{
            	
        		hairetsu_keta[j] = keta;
        		keta = 0;//space ga kitara tsugi no moji no tame keta ha sokomade
        		j++;
        	}
        	if (deru > 0)
        	{
        		break;
            	}
        }
           // ?¨??????\?????????????????????????????????????????????
        
        // ??°??????????????\??????
        //int hairetsu_suuchi[] = new int[4]; hairetsu_suuchi[0] = 0; hairetsu_suuchi[1] = 0; hairetsu_suuchi[2] = 0; hairetsu_suuchi[3] = 0;
        int hairetsu_suuchi[] = {0,0,0,0,0,0,0,0,0,0};//???????????¨???????????¨????????£????????????
        int k = 0;
        int m = 0;
        int n = 0;
        
        
        while( n < (j + 1))
        {
        while(j > 0 && hairetsu_keta[n] > 0 )
        {
        	hairetsu_suuchi[k] = hairetsu_suuchi[k]*10 + hairetsu[m];
        	hairetsu_keta[n] = hairetsu_keta[n] - 1;
        	m++;
        }
        if (hairetsu_keta[n] == 0)
        {
        	n++;
        	k++;
        }
        }   	

        //??°??????????????\???????????????
        /*
          for (int p = 0; p < k - 1 ; p++)
        
        {
        System.out.println("???????????°??????" + hairetsu_suuchi[p]);     
        }	
        	*/	
        if (hairetsu_suuchi[0] > hairetsu_suuchi[1])
        {
         System.out.println(
        		 hairetsu_suuchi[0] +">" + hairetsu_suuchi[1]
        		 );
        }
         if (hairetsu_suuchi[0] < hairetsu_suuchi[1])
        {
         System.out.println(
        		 hairetsu_suuchi[0] +"<" + hairetsu_suuchi[1]
        		 );
        }
         if (hairetsu_suuchi[0] == hairetsu_suuchi[1])
        
        {
            System.out.println(
           		 hairetsu_suuchi[0] +"=" + hairetsu_suuchi[1]
           		 );
           }	
        
            }

}