PAT-A1058 A+B in Hogwarts【进制转换】【字符查找】

最新推荐文章于 2021-09-13 20:12:25 发布

争渡！怎渡？

最新推荐文章于 2021-09-13 20:12:25 发布

阅读量3.8w

点赞数 1

分类专栏：保研准备文章标签：算法

本文链接：https://blog.csdn.net/gdc6916/article/details/106161309

版权

保研准备专栏收录该内容

84 篇文章 2 订阅

订阅专栏

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

#include <iostream>
#include <string>
using namespace std;
int low=0;
int middle=0;
int high=0;
void getAdd(string s){
	int index1=s.find_first_of('.');
	int index2=s.find_last_of('.');
	low+=atoi(s.substr(index2+1,s.size()-index2-1).c_str());
	if(low>=29){
		low-=29;
		middle+=1;
	}
	middle+=atoi(s.substr(index1+1,index2-index1-1).c_str());
	if(middle>=17){
		middle-=17;
		high+=1;
	}
	high+=atoi(s.substr(0,index1).c_str());
	
}
int main(){
	string one;
	string two;
	cin>>one;
	cin>>two;
	getAdd(one);
	getAdd(two);
	cout<<high<<"."<<middle<<"."<<low<<endl;
	return 0;
}