-------Pokemon Master------很水-------
2016-01-03 16:12
141 查看
A - Pokemon Master Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description Calem and Serena are pokemon masters. One day they decided to have a pokemon battle practice before Pokemon World Championships. Each of them has some pokemons in each's team. To make the battle more interesting, they decided to use a special rule to determine the winner: the team with heavier total weight will win the battle! Input There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case: The first line contains two integers N and M (1 <= N, M <= 6), which describes that Calem has N pokemons and Serena has M pokemons. The second line contains N integers indicating the weight of Calem's pokemons. The third line contains M integers indicating the weight of Serena's pokemons. All pokemons' weight are in the range of [1, 2094] pounds. Output For each test case, output "Calem" if Calem's team will win the battle, or "Serena" if Serena's team will win. If the two team have the same total weight, output "Draw" instead. Sample Input 1 6 6 13 220 199 188 269 1014 101 176 130 220 881 396 Sample Output Serena
臭长题目其实没有多少技术含量.
意思就是 第一行数据是测试案例数. 第二行是 每个人拥有的拥有的什么鬼东西的重量,让你求出分别拥有的重量之和,谁的大谁就赢了.平局的话输出平局.
#include<stdio.h> int main() { int t, n, m; scanf("%d", &t); while (t--) { scanf("%d %d", &n, &m); int i, num, s1 = 0, s2 = 0; for (i = 0; i < n; i++) { scanf("%d", &num); s1 += num; } for (i = 0; i < m; i++) { scanf("%d", &num); s2 += num; } if (s1 == s2) printf("Draw"); else printf(s1 > s2 ? "Calem" : "Serena"); //这里运用了三目运算符 很节省篇幅.......值得学习,如果?之前的条件成立的话,就执行紧挨着的,否则就执行:后面的 } return 0; }
相关文章推荐
- Android大牛博客
- 调试终端命令行的位置
- 2016, 新的一年,新的起点
- 两标关联update
- 使用Windbg解析dump文件
- [easyui]单例模式封装组件,提高性能,按需使用
- linux下网络探测工具nmap的使用小结
- 闭包例子
- OC为什么需要copy
- HDOJ 1466 计算直线的交点数 (DP)
- android https通过载入pfx证书获取数据
- 灵活运用 SQL SERVER FOR XML PATH
- Convolutional Neural Networks at Constrained Time Cost(精读)
- 求两个数的最大公约数 (函数的递归调用)
- 51nod1449&&Codeforce 552C
- xendesktop7.6虚拟桌面U盘重定向
- Java读书笔记(5)-网络编程
- IOS开发基础Object-C(13)—— protocol协议
- (二)WCF的Binding模型
- java的throw和throws