PAT (Advanced Level) 1058. A+B in Hogwarts (20) 字符串相加
来源:互联网 发布:windows激活注销死循环 编辑:程序博客网 时间:2024/05/22 06:33
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.27Sample Output:
14.1.28
简单的字符串相加。/*2015.7.27cyq*/#include <iostream>using namespace std;int main(){int a1,b1,c1,a2,b2,c2;scanf("%d.%d.%d",&a1,&b1,&c1);scanf("%d.%d.%d",&a2,&b2,&c2);int a,b,c,carry;c=(c1+c2)%29;carry=(c1+c2)/29;b=(b1+b2+carry)%17;carry=(b1+b2+carry)/17;a=a1+a2+carry;printf("%d.%d.%d",a,b,c);return 0;}
- PAT (Advanced Level) 1058. A+B in Hogwarts (20) 字符串相加
- 【c++】PAT(advanced level)1058. A+B in Hogwarts (20)
- 【PAT (Advanced Level)】1058. A+B in Hogwarts (20)
- 【PAT】【Advanced Level】1058. A+B in Hogwarts (20)
- PAT (Advanced Level) Practise 1058 A+B in Hogwarts (20)
- PAT (Advanced Level) Practise 1058 A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)【水题】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1058(A+B in Hogwarts)
- 1058. A+B in Hogwarts (20)- PAT
- 【PAT】1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- pat 1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- PAT---1058. A+B in Hogwarts (20)
- PAT-A 1058. A+B in Hogwarts
- PAT A 1058. A+B in Hogwarts (20)
- UVa 12716 - GCD XOR(筛选+规律)
- deep learning入门教材
- Android中gravity的各种效果图
- 试解释操作系统原理中的作业,进程,线程,管程各自的定义。进程间的通信如何实现?
- 非线性支持向量机学习算法
- PAT (Advanced Level) 1058. A+B in Hogwarts (20) 字符串相加
- HDU3746 Cyclic Nacklace(KMP_Next的应用)
- 2.数组和字典的相互嵌套
- python 用pyftplib快速建设ftp
- 内存管理
- 机房收费系统问题总结(一)
- 先临三维 真的收购 天远三维啦 我的天啊
- PLSQL Developer常用设置及快捷键
- 越獄之-卡车的历史(Truck History)