1058. A+B in Hogwarts (20)
2016-07-17 13:27
246 查看
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:
Sample Output:
对应的位相加,求余和求进位就行了。
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
int a1,b1,c1,a2,b2,c2;
scanf("%d.%d.%d %d.%d.%d",&a1,&b1,&c1,&a2,&b2,&c2);
int r=0;
int z=(c1+c2)%29;
r=(c1+c2)/29;
int y=(b1+b2+r)%17;
r=(b1+b2+r)/17;
int x=a1+a2+r;
printf("%d.%d.%d",x,y,z);
}
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 <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
int a1,b1,c1,a2,b2,c2;
scanf("%d.%d.%d %d.%d.%d",&a1,&b1,&c1,&a2,&b2,&c2);
int r=0;
int z=(c1+c2)%29;
r=(c1+c2)/29;
int y=(b1+b2+r)%17;
r=(b1+b2+r)/17;
int x=a1+a2+r;
printf("%d.%d.%d",x,y,z);
}
相关文章推荐
- 解决VMware虚拟机不能上网的问题
- html5地理定位原理
- Java内存模型
- bind
- 强大的德国教育如何锻造孩子的健全人格
- 【Java】Java中关于HashMap的使用和遍历
- [Android Pro] Android 进程级别 和 oom_adj对应关系
- 部署exchange2010三合一:之六:创建接收连接器
- L1-028. 判断素数
- 15级新成员第一次会议
- eclipse中关于复制和移动一行代码的快捷键
- CodeForces 113D Museum (高斯消元)
- POJ 3614 Sunscreen
- 欢迎使用CSDN-markdown编辑器
- Q&A
- linux - 公有云发布个人静态站点
- exchange2010集线器传输相关知识
- ajax访问后台后前台永远执行error的回调函数
- Spring 装配Bean入门级
- CodeForces 623D Birthday (贪心)