pat1058 A+B in Hogwarts
来源:互联网 发布:终极算法 改变世界 编辑:程序博客网 时间:2024/05/17 22:00
#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<string>#include<cstring>#include<cmath>#include<map>#define ll long longusing namespace std;int main(){ int a,b,c,d,e,f,x,y,z;while(scanf("%d.%d.%d %d.%d.%d",&a,&b,&c,&d,&e,&f)!=EOF){if(c+f>=29){z = c+f-29;b++;}else z = c+f;if(b+e>=17){y = b+e-17;a++;}else y = b+e;x = a+d;printf("%d.%d.%d\n",x,y,z);} return 0;}
0 0
- pat1058 A+B in Hogwarts
- A+B in Hogwarts
- A+B in Hogwarts
- A+B in Hogwarts
- 1058. A+B in Hogwarts
- 1058. A+B in Hogwarts
- 1058.A+B in Hogwarts
- 1058. A+B in Hogwarts
- 1058. A+B in Hogwarts
- 1058 A+B in Hogwarts
- 1058. A+B in Hogwarts
- PAT_1058. A+B in Hogwarts
- PAT-A 1058. A+B in Hogwarts
- 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)
- Cocos2d-x 3.0final 终结者系列教程13-贪食蛇游戏案例(全)
- 二叉树的输出
- POJ 2387 Til the Cows Come Home(Dijkstra判重边)
- Cocos2d-x 3.3 的3D开发功能介绍
- 各种排序算法的分析及java实现
- pat1058 A+B in Hogwarts
- c#开发微信企业号的一些心得
- POJ3233解题报告
- LeetCode:Rotate Array
- 做产品16年,9条心得
- Binary Tree Inorder Traversal - Leetcode
- 使用GCD的dispatch_once创建单例
- MySQL数据库的服务器端卸载----->MySQL
- Cocos2d-x 3.0final 终结者系列教程22Cocos Studio动画编辑器的帧动画和骨骼动画详解