CodeForces 616A Comparing Two Long Integers

 水题

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn=1000000+10;
char s1[maxn],s2[maxn];
int a[maxn],b[maxn];
int lena,lenb;
int c;

int main()
{
    scanf("%s%s",s1,s2);
    lena=strlen(s1);
    lenb=strlen(s2);

    c=0; for(int i=lena-1;i>=0;i--) a[c++]=s1[i]-'0';
    c=0; for(int i=lenb-1;i>=0;i--) b[c++]=s2[i]-'0';

    for(int i=lena;i<max(lena,lenb);i++) a[i]=0;
    for(int i=lenb;i<max(lena,lenb);i++) b[i]=0;

    int flag=0;
    for(int i=max(lena,lenb)-1;i>=0;i--)
    {
        if(a[i]!=b[i]){
            if(a[i]>b[i]) printf(">
");
            else printf("<
");
            flag=1;
            break;
        }
    }
    if(!flag) printf("=
");
    return 0;
}
原文地址:https://www.cnblogs.com/zufezzt/p/5130227.html