cf 616A Comparing Two Long Integers

问题描述

You are given two very long integers a, b (leading zeroes are allowed). You should check what number a or b is greater or determine that they are equal.

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/printf instead 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().


输入

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 digits.


输出

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


样例输入

Input
9
10
Output
<
Input
11
10
Output
>
Input
00012345
12345
Output
=
Input
0123
9
Output
>
Input
0123
111
Output
>


代码如下:

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

char a[1000005],b[1000005];

int main()
{
    scanf("%s",&a);
    scanf("%s",&b);
    int len1=strlen(a);
    int len2=strlen(b);
    int ii=0,jj=0;
    while(a[ii]=='0')ii++;
    while(b[jj]=='0')jj++;
    if(len1-ii>len2-jj)
        printf("%c\n",'>');
    else if(len1-ii<len2-jj)
        printf("%c\n",'<');

    else
        {
            for(;ii<len1;ii++,jj++)
            {
                if(a[ii]<b[jj])
                {
                    printf("%c\n",'<');
                    break;
                }

                else if(a[ii]>b[jj])
                {
                    printf("%c\n",'>');break;
                }

            }
            if(ii==len1)
                printf("%c\n",'=');
        }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值