PAT 1058. A+B in Hogwarts (20)
来源:互联网 发布:开源oa系统 java 编辑:程序博客网 时间:2024/06/03 16:00
1058. A+B in Hogwarts (20)
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
提交代码
/*输入格式控制 scanf("%d%*c%d%*c%d %d%*c%d%*c%d", );其中 %*c 用来跳过 任意某个 字符。*/#include<stdio.h>#include<string.h>const int MAX=10000;int a[3],b[3],c[3];void add(int a[],int b[]){c[0]=(a[0]+b[0])%29;c[1]=(a[1]+b[1]+(a[0]+b[0])/29)%17;c[2]=a[2]+b[2]+(a[1]+b[1]+(a[0]+b[0])/29)/17;}int main(){//freopen("G:\\in.txt","r",stdin);//freopen("G:\\our.txt","w",stdout);while(scanf("%d%*c%d%*c%d %d%*c%d%*c%d",&a[2],&a[1],&a[0],&b[2],&b[1],&b[0])!=EOF){add(a,b);printf("%d.%d.%d\n",c[2],c[1],c[0]);}return 0;}
- 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)
- PAT(A) - 1058. A+B in Hogwarts (20)
- PAT-A 1058. A+B in Hogwarts (20)
- PAT-A-1058. A+B in Hogwarts (20)
- PAT 1058. A+B in Hogwarts
- 【PAT】1058. A+B in Hogwarts
- PAT-A+B in Hogwarts (20)
- PAT 1018A+B in Hogwarts (20)
- 【PAT】A1058. A+B in Hogwarts (20)
- java从文件中读取内容方法
- windows下配置git默认编辑器
- 如何做域名解析(A记录、CNAME记录、URL转发、二级域名)
- sort
- (七)类
- PAT 1058. A+B in Hogwarts (20)
- android手机分享
- Android的五种存储方式
- Arrays_Strings 翻转字符串 @CareerCup
- Ward BRDF实现心得
- JavaScript高级之函数的四种调用形式
- github设置添加SSH
- 盒模型:外边距叠加和外边距为负值
- win7的centos虚拟机上搭建mysql5.6服务