A == B ?

A == B ?

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 64960    Accepted Submission(s): 10164


Problem Description
Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO".
 

Input
each test case contains two numbers A and B.
 

Output
for each case, if A is equal to B, you should print "YES", or print "NO".
 

Sample Input
1 2 2 2 3 3 4 3
 

Sample Output
NO YES YES NO

注意细节,注意取值范围,小数点

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define LEN 100000
int main() {
    char a[LEN];
    char b[LEN];
    int lena, lenb, len, i;
    while(cin >> a >> b) {
        lena = 0;
        lenb = 0;
        len = strlen(a);
        len--;
        for(i = 0; i <= len; i++) {
            if(a[i] == '.') {
                lena = i;
                break;
            }
        }
        while(a[len] == '0' && len > lena && lena != 0) {
            a[len] = '\0';
            len--;
        }
        if(a[len] == '.') {
           a[len] = '\0';
        }

        len = strlen(b);
        len--;
        for(i = 0; i <= len; i++) {
            if(b[i] == '.') {
                lenb = i;
                break;
            }
        }
        while(b[len] == '0' && len > lenb && lenb != 0) {
            b[len] = '\0';
            len--;
        }
        if(b[len] == '.') {
            b[len] = '\0';
        }
        if(strcmp(a, b) == 0) {
            cout << "YES" << endl;
        }
        else {
            cout << "NO" << endl;
        }
    }
    return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值