Gym 100735 - I. Yet another A + B

最新推荐文章于 2020-01-11 16:15:43 发布

Infinity_Izayoi

最新推荐文章于 2020-01-11 16:15:43 发布

阅读量501

点赞数

分类专栏： ACM之路模拟文章标签： acm

本文链接：https://blog.csdn.net/Infinity_Izayoi/article/details/51914666

版权

ACM之路同时被 2 个专栏收录

86 篇文章 1 订阅

订阅专栏

模拟

3 篇文章 0 订阅

订阅专栏

题目链接:

http://codeforces.com/gym/100735/problem/I；

题意:

给出三个数A,B,C，如果三个数随机排列满足两个相加等于第三个的情况输出YES，否则NO

题解:

大数加法

AC代码（来自hacb教练）

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <stdio.h>
using namespace std;
struct Tr{
    int num[120];
    Tr operator+(Tr a)const
    {
        Tr tm;
        memset(tm.num, 0, sizeof(tm.num));
        int in = 0, i;
        for (i = 0;i < 120;i++)
        {
            tm.num[i] = (num[i]+a.num[i]+in)%10;
            in = (num[i]+a.num[i]+in)/10;
        }
        return tm;
    }
    bool operator==(Tr a)const
    {
        int i;
        for (i = 119;i >= 0;i--)
        {
            if (num[i] != a.num[i]) return false;
        }
        return true;
    }
}A, B, C;

char a[110], b[110], c[110];

int main() {
    int i, j;
    while (~scanf("%s%s%s", a, b, c)) {
        memset(A.num, 0, sizeof(A.num));
        memset(B.num, 0, sizeof(B.num));
        memset(C.num, 0, sizeof(C.num));
        int la = strlen(a), lb = strlen(b), lc = strlen(c);
        for (i = la-1;i >= 0;i--) A.num[la-1-i] = a[i]-'0';
        for (i = lb-1;i >= 0;i--) B.num[lb-1-i] = b[i]-'0';
        for (i = lc-1;i >= 0;i--) C.num[lc-1-i] = c[i]-'0';
        if (A+B == C || A+C == B || B+C==A) puts("YES");
        else if (A+A == C || B+B==C || B+B==A || C+C == B || C+C == A || A+A==B) puts("YES");
        else puts("NO");
    }
}