PAT甲级练习1058. A+B in Hogwarts (20)

最新推荐文章于 2022-03-01 16:06:52 发布

a1025461748

最新推荐文章于 2022-03-01 16:06:52 发布

阅读量167

点赞数

分类专栏： PAT甲级练习

本文链接：https://blog.csdn.net/a1025461748/article/details/57965787

版权

PAT甲级练习专栏收录该内容

104 篇文章 0 订阅

订阅专栏

1058. A+B in Hogwarts (20)

时间限制

50 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

进制转换的题，先转到最小的位相加再转回来，用long long

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <string.h>

using namespace std;

const int MAX=1e5+10;

int n, x, size;

int main(){
	long long a, b, c, a1, a2, a3, b1, b2, b3;
	scanf("%lld.%lld.%lld %lld.%lld.%lld", &a1, &a2, &a3, &b1, &b2, &b3);
	
	a = a1 * 17 * 29 + a2 * 29 + a3;
	b = b1 * 17 * 29 + b2 * 29 + b3;
	c = a + b;
	printf("%lld.%lld.%lld\n", c/(17*29), (c/29)%17, c%29);

	cin>>n;
	return 0;
}