PAT 1058. A+B in Hogwarts (20)

最新推荐文章于 2022-07-22 15:03:25 发布

原创最新推荐文章于 2022-07-22 15:03:25 发布 · 144 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT

本文介绍了一个基于哈利波特魔法世界货币系统的计算程序。该程序能够处理输入的两种货币形式（以加隆、西可和纳特为单位），并计算它们的总和。文章提供了完整的C++代码实现，展示了如何进行不同单位间的进位转换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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, 10⁷], 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

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
  int g1,s1,k1,g2,s2,k2,g3,s3,k3;
  scanf("%d.%d.%d %d.%d.%d",&g1,&s1,&k1,&g2,&s2,&k2);
  if(k1 + k2 < 29)
    k3 = k1 + k2;
  else
    k3 = (k1 + k2) % 29;
  if((k1 + k2) / 29 + s1 + s2 < 17)
      s3 = s1 + s2 + (k1 + k2) / 29;
  else
      s3 = ((k1 + k2) / 29 + s1 + s2) % 17;
   g3 = g1 + g2 + ((k1 + k2) / 29 + s1 + s2) / 17;
  printf("%d.%d.%d\n",g3,s3,k3);
  return 0;
}