【PAT (Advanced Level)】1058. A+B in Hogwarts (20)

最新推荐文章于 2019-02-02 18:12:04 发布

Merlone

最新推荐文章于 2019-02-02 18:12:04 发布

阅读量729

点赞数

分类专栏：编程练习文章标签： PAT

本文链接：https://blog.csdn.net/merlone/article/details/38385565

版权

编程练习专栏收录该内容

16 篇文章 0 订阅

订阅专栏

1058. A+B in Hogwarts (20)

时间限制

50 ms

内存限制

32000 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

言简意赅，不多说；

代码：

/************************************
This is a test program for anything
Enjoy IT!
************************************/

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <list>
#include <set>
#include <fstream>
#include <string>
#include <cmath>
using namespace std;

int main()
{
	/*ifstream cin;
	cin.open("in.txt");
	ofstream cout;
	cout.open("out.txt");*/
	//
	// TO DO Whatever You WANT!
	string s1, s2;
	while (cin >> s1 >> s2)
	{
		int a[3] = { 0 }, b[3] = { 0 }, c[3] = { 0 };
		int j = 0;
		for (int i = 0; i < s1.length(); i++)
		{
			if (s1[i] == '.')
			{
				j++;
				continue;
			}
			a[j] = a[j] * 10 + s1[i] - '0';
		}
		j = 0;
		for (int i = 0; i < s2.length(); i++)
		{
			if (s2[i] == '.')
			{
				j++;
				continue;
			}
			b[j] = b[j] * 10 + s2[i] - '0';
		}
		int t;
		c[2] = (a[2] + b[2]) % 29;
		t = (a[2] + b[2]) / 29;
		c[1] = (a[1] + b[1] + t) % 17;
		t = (a[1] + b[1] + t) / 17;
		c[0] = (a[0] + b[0] + t);
		cout << c[0] << "." << c[1] << "." << c[2] << endl;
	}
	//
	// system("pause");
	return 0;
}