Time Limit: 2000MS

 

Memory Limit: 262144KB

 

64bit IO Format: %I64d & %I64u

CodeForces - 616A


Comparing Two Long Integers



Submit Status




Description




You are given two very long integers a, b (leading zeroes are allowed). You should check what number a or b

The input size is very large so don't use the reading of symbols one by one. Instead of that use the reading of a whole line or token.

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printfinstead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. Don't use the function input() in Python2 instead of it use the function raw_input().






Input




The first line contains a non-negative integer a.

The second line contains a non-negative integer b.

The numbers a, b may contain leading zeroes. Each of them contains no more than 106






Output




Print the symbol "<" if a < b and the symbol ">" if a > b. If the numbers are equal print the symbol "=".






Sample Input





Input



910





Output



<





Input



1110





Output



>





Input



0001234512345





Output



=





Input



01239





Output



>





Input



0123111





Output



>





Source



Educational Codeforces Round 5 




#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<map>
#include<stack>
#include<queue>
#include<math.h>
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define ll long long
#define IN __int64
#define N 1000010
#define M 1000000007
using namespace std;
char a[N],b[N];
char x[N],y[N];
int main()
{
	int t,n,m,i,j,k;
	while(scanf("%s%s",a,b)!=EOF)
	{
		int aa=0,bb=0,la,lb,ka,kb;
		la=strlen(a);lb=strlen(b);
		bool fa=false,fb=false;
		if(strcmp(a,b)==0)
		{
			printf("=\n");
			continue;
		}
		for(i=0;i<la;i++)
		{
			if(a[i]=='0')
			{
				aa=i;
				fa=true;
				continue;
			}
			else
				break;
		}
		for(i=0;i<lb;i++)
		{
			if(b[i]=='0')
			{
				bb=i;
				fb=true;
				continue;
			}
			else
				break;
		}
		if(fa) aa++;
		if(fb) bb++;
		ka=0;kb=0;
		for(i=aa;i<la;i++)
			x[ka++]=a[i];
		for(i=bb;i<lb;i++)
			y[kb++]=b[i];
		if(ka>kb)
			printf(">\n");
		else if(ka<kb)
			printf("<\n");
		else
		{
			if(strcmp(x,y)>0)
				printf(">\n");
			else if(strcmp(x,y)==0)
				printf("=\n");
			else
				printf("<\n");
		}
		memset(a,'\0',sizeof(a));
		memset(b,'\0',sizeof(b));
		memset(x,'\0',sizeof(x));
		memset(y,'\0',sizeof(y));
	}
	return 0;
}