1006. Sign In and Sign Out (25)
来源:互联网 发布:136书屋下载软件 编辑:程序博客网 时间:2024/05/22 06:23
1006. Sign In and Sign Out (25)
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find the ones who have unlocked and locked the door on that day.
Input Specification:
Each input file contains one test case. Each case contains the records for one day. The case starts with a positive integer M, which is the total number of records, followed by M lines, each in the format:
ID_number Sign_in_time Sign_out_time
where times are given in the format HH:MM:SS, and ID number is a string with no more than 15 characters.
Output Specification:
For each test case, output in one line the ID numbers of the persons who have unlocked and locked the door on that day. The two ID numbers must be separated by one space.
Note: It is guaranteed that the records are consistent. That is, the sign in time must be earlier than the sign out time for each person, and there are no two persons sign in or out at the same moment.
Sample Input:3CS301111 15:30:28 17:00:10SC3021234 08:00:00 11:25:25CS301133 21:45:00 21:58:40Sample Output:
SC3021234 CS301133
题意分析:输出来得最早与最晚学生的编号,利用strcpy函数即可解决
AC代码:
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;int main(){ int m; scanf("%d",&m); if(m!=0) { int i; char name[20],early[10],late[10]; char name1[20],early1[10],name2[20],late2[10]; scanf("%s%s%s",name,early,late); strcpy(name1,name); strcpy(name2,name); strcpy(early1,early); strcpy(late2,late); for(i=1;i<m;i++) { scanf("%s%s%s",name,early,late); if(strcmp(early,early1)<0) { strcpy(name1,name); strcpy(early1,early); } if(strcmp(late,late2)>0) { strcpy(name2,name); strcpy(late2,late); } } printf("%s %s\n",name1,name2); } return 0;}
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)
- tomcat优化
- effect C++ 复制对象时勿忘其每一个成分
- 素数分解
- 设计模式笔记(java版)
- 18.模拟 CAS 算法
- 1006. Sign In and Sign Out (25)
- 1017 乘积最大
- 基于UDP的同步聊天(无界面实现)
- 素数筛
- 实时零相位滤波的神话(1)
- edit限制输入身份证号
- Windows下使用Sublime Text 3调试/运行 C/C++ 程序
- MySQL笔记-trigger与index
- Mycat生产实践---性能调优