1058. A+B in Hogwarts (20)
来源:互联网 发布:网络语言黑洞什么意思 编辑:程序博客网 时间:2024/05/16 12:38
#include<stdio.h>int main (){ int a[3],b[3],c[3]={200000000,17,29};scanf("%d.%d.%d",&a[0],&a[1],&a[2]);scanf("%d.%d.%d",&b[0],&b[1],&b[2]);int i,temp=0;for (i=2;i>=0;i--){b[i]=b[i]+a[i]+temp;temp=b[i]/c[i];b[i]=b[i]%c[i];} // b[0]=b[0]+a[0]+temp; printf("%d.%d.%d",b[0],b[1],b[2]);return 0;}
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
分析:
用C输入格式会很方便,其实直接加不用循环都可以了。
0 0
- 1058. A+B in Hogwarts (20)- PAT
- 【PAT】1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- pat 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts (20)
- 1058. A+B in Hogwarts (20)
- 改变从github开始吧
- Hibernate4.3.5 双向一对多示例
- 花心雨的世界
- Spring实例化Bean的三种方式
- redis数据结构
- 1058. A+B in Hogwarts (20)
- 关于strtok的一点简单认识
- Codeforces 453A Little Pony and Expected Maximum 概率期望
- Linux Shortcut Key
- [DFS][toj1009Sticks]
- [编程之美] PSet2.11 寻找最近点对
- 并查集及并查集的路径压缩
- 菜鸟学习javaweb(二)--可变参数
- EAS数据库IO等待分析及优化报告