博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Gym 100952A&&2015 HIAST Collegiate Programming Contest A. Who is the winner?【字符串,暴力】
阅读量:4635 次
发布时间:2019-06-09

本文共 2621 字,大约阅读时间需要 8 分钟。

A. Who is the winner?

time limit per test:1 second
memory limit per test:64 megabytes
input:standard input
output:standard output

A big marathon is held on Al-Maza Road, Damascus. Runners came from all over the world to run all the way along the road in this big marathon day. The winner is the player who crosses the finish line first.

The organizers write down finish line crossing time for each player. After the end of the marathon, they had a doubt between 2 possible winners named "Player1" and "Player2". They will give you the crossing time for those players and they want you to say who is the winner?

Input

First line contains number of test cases (1  ≤  T  ≤  100). Each of the next T lines represents one test case with 6 integers H1 M1 S1 H2 M2 S2. Where H1, M1, S1 represent Player1 crossing time (hours, minutes, seconds) and H2, M2, S2 represent Player2 crossing time (hours, minutes, seconds). You can assume that Player1 and Player2 crossing times are on the same day and they are represented in 24 hours format(0  ≤  H1,H2  ≤  23 and 0  ≤  M1,M2,S1,S2  ≤  59)

H1, M1, S1, H2, M2 and S2 will be represented by exactly 2 digits (leading zeros if necessary).

Output

For each test case, you should print one line containing "Player1" if Player1 is the winner, "Player2" if Player2 is the winner or "Tie" if there is a tie.

Examples
Input
3 18 03 04 14 03 05 09 45 33 12 03 01 06 36 03 06 36 03
Output
Player2 Player1 Tie

题目链接:
题意:给定两组时间,包括时:分:秒三种信息,比较求解两组时间哪一个最短!
分析:直接做,忽略前导0,直接输入整数就好,当时以为是字符串输入,搞了半天都出不来!
下面给出AC代码:
1 #include 
2 using namespace std; 3 typedef long long ll; 4 inline int read() 5 { 6 int x=0,f=1; 7 char ch=getchar(); 8 while(ch<'0'||ch>'9') 9 {10 if(ch=='-')11 f=-1;12 ch=getchar();13 }14 while(ch>='0'&&ch<='9')15 {16 x=x*10+ch-'0';17 ch=getchar();18 }19 return x*f;20 }21 inline void write(int x)22 {23 if(x<0)24 {25 putchar('-');26 x=-x;27 }28 if(x>9)29 {30 write(x/10);31 }32 putchar(x%10+'0');33 }34 int a[3],b[3];35 int n;36 int main()37 {38 n=read();39 while(n--)40 {41 //cin.getline(s1,8);42 //cin.getline(s2,8);43 for(int i=0;i<3;i++)44 a[i]=read();45 for(int i=0;i<3;i++)46 b[i]=read();47 int flag=-1;48 for(int i=0;i<3;i++)49 {50 if(a[i]>b[i])51 {52 flag=1;53 break;54 }55 else if(a[i]

 

转载于:https://www.cnblogs.com/ECJTUACM-873284962/p/7226904.html

你可能感兴趣的文章
mysql中的数据类型
查看>>
19-6/28作业:100以内偶数求和
查看>>
TKmybatis和mybatisplus哪个好用
查看>>
iframe 子父窗口互掉 js
查看>>
函数对象 函数嵌套 名称空间与作用域
查看>>
SSIS 包部署错误 0xC0010014
查看>>
java 第11次作业:你能看懂就说明你理解了——this关键字
查看>>
git 代理设置
查看>>
ORACLE查询表最近更改的数据
查看>>
如果我们不曾相遇
查看>>
输入圆的半径,计算并输出圆的周长和面积
查看>>
metric learning -- 马氏距离与欧氏距离
查看>>
HashMap HashTable ConcurrentHashMap
查看>>
2进制 , 8进制 , 10进制 , 16进制 , 介绍 及 相互转换 及 快速转换
查看>>
C/C++心得-结构体
查看>>
快速解决 GRADLE 项目下载 gradle-*-all.zip 慢的问题
查看>>
【第二章】 IoC 之 2.1 IoC基础 ——跟我学Spring3
查看>>
函数名作为参数传递
查看>>
apt-get for ubuntu 工具简介
查看>>
数值计算算法-多项式插值算法的实现与分析
查看>>