zoukankan      html  css  js  c++  java
  • 1058. A+B in Hogwarts (20)

    题目如下:

    If you are a fan of Harry Potter, you would know the world of magic has its own currency system -- as Hagrid explained it to Harry, "Seventeen silver Sickles to a Galleon and twenty-nine Knuts to a Sickle, it's easy enough." Your job is to write a program to compute A+B where A and B are given in the standard form of "Galleon.Sickle.Knut" (Galleon is an integer in [0, 107], Sickle is an integer in [0, 17), and Knut is an integer in [0, 29)).

    Input Specification:

    Each input file contains one test case which occupies a line with A and B in the standard form, separated by one space.

    Output Specification:

    For each test case you should output the sum of A and B in one line, with the same format as the input.

    Sample Input:
    3.2.1 10.16.27
    
    Sample Output:
    14.1.28
    


    设计一个结构体存储G、S、K三位,根据题目条件进位即可。

    #include <iostream>
    #include <stdio.h>
    
    using namespace std;
    
    struct GSK{
        int G;
        int S;
        int K;
    
        void add(GSK other){
            int carry;
            K += other.K;
            carry = K / 29;
            K = K % 29;
            S = S + carry + other.S;
            carry = S / 17;
            S = S % 17;
            G = G + carry + other.G;
        }
    
    };
    
    int main()
    {
        GSK n1,n2;
        scanf("%d.%d.%d",&n1.G,&n1.S,&n1.K);
        scanf("%d.%d.%d",&n2.G,&n2.S,&n2.K);
        n1.add(n2);
        printf("%d.%d.%d",n1.G,n1.S,n1.K);
        return 0;
    }
    


  • 相关阅读:
    [研究笔记]SPFA加上SLF时判负环的条件
    hdu 1290
    hdu 2135
    hdu 1978 how many way
    华中区全国程序设计邀请赛1003
    华中区程序设计大赛1010
    华中程序设计邀请赛1007
    华中区全国设计邀请赛1009
    hdu 2114的补充
    华中区全国设计邀请赛1004
  • 原文地址:https://www.cnblogs.com/aiwz/p/6154110.html
Copyright © 2011-2022 走看看