CodeForces - 616A Comparing Two Long Integers

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

typedef long long ll;
const int maxn = 1000000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;


char s[maxn], t[maxn];

int main() {
    scanf("%s%s", s, t);
    int lens = strlen(s), lent = strlen(t);
    int i = 0, j = 0;
    while(s[i] == '0') ++i;
    while(t[j] == '0') ++j;

    if(lens-i > lent-j) return 0*puts(">");
    else if(lens-i < lent-j) return 0*puts("<");
    else {

        for( ; i < lens && j < lent; ++i,++j) {
            if(s[i] < t[j]) return 0*puts("<");
            else if(s[i] > t[j]) return 0*puts(">");
        }
        return 0*puts("=");
    }

    return 0;
}