【PTA】- 1058 A+B in Hogwarts (20 分)

最新推荐文章于 2023-07-07 16:57:11 发布

<-krush->

最新推荐文章于 2023-07-07 16:57:11 发布

阅读量138

点赞数

分类专栏： ▼ 算法 ▼ ACM | 算法训练 >> 【PAT】

本文链接：https://blog.csdn.net/qq_33592583/article/details/103371761

版权

>> 【PAT】同时被 3 个专栏收录

21 篇文章 0 订阅

订阅专栏

▼ ACM | 算法训练

18 篇文章 0 订阅

订阅专栏

▼ 算法

16 篇文章 0 订阅

订阅专栏

题目链接: https://pintia.cn/problem-sets/994805342720868352/problems/994805416519647232

知识点：简单模拟

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
using namespace std;
#define inf 0x3f3f3f3f
int main(int argc, const char **argv)
{
    int a1, b1, c1, a2, b2, c2;
    scanf("%d.%d.%d %d.%d.%d", &a1, &b1, &c1, &a2, &b2, &c2);
    int sum1, sum2, sum3;
    int carray1, carray2;
    if (c2 + c1 >= 29)
    {
        sum3 = (c1 + c2) % 29;
        carray1 = (c1 + c2) / 29;
    }
    else
    {
        sum3 = (c1 + c2);
        carray1 = 0;
    }
    if (carray1 + b1 + b2 >= 17)
    {
        sum2 = (b1 + b2 + carray1) % 17;
        carray2 = (b1 + b2 + carray1) / 17;
    }
    else
    {
        sum2 = (b1 + b2 + carray1);
        carray2 = 0;
    }
    sum1 = carray2 + a1 + a2;
    printf("%d.%d.%d\n", sum1, sum2, sum3);

    return 0;
}