zoukankan      html  css  js  c++  java
  • 甲级1006 Sign In and Sign Out

    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:

    3
    CS301111 15:30:28 17:00:10
    SC3021234 08:00:00 11:25:25
    CS301133 21:45:00 21:58:40
    

    Sample Output:

    SC3021234 CS301133


    分析:时间比较用strcmp,如果用的string就用重载的大于号小于号

    代码如下:
     1 #include <iostream>
     2 #include <cstring>
     3 using namespace std;
     4 
     5 int main()
     6 {
     7     int record_count;
     8     char in_stu[20], out_stu[20];
     9     char in_time[10] = "24:00:00";
    10     char out_time[10] = "00:00:00";
    11     cin >> record_count;
    12     char s[20], a[10], b[10];
    13     for (int i = 0; i < record_count; i++)
    14     {
    15         scanf("%s %s %s", s, a, b);
    16         if (strcmp(a, in_time) < 0)
    17         {
    18             strcpy(in_time, a);
    19             strcpy(in_stu, s);
    20         }
    21         if (strcmp(b, out_time) > 0)
    22         {
    23             strcpy(out_time, b);
    24             strcpy(out_stu, s);
    25         }
    26     }
    27     printf("%s %s", in_stu, out_stu);
    28     return 0;
    29 }
     
  • 相关阅读:
    CSP-S2019 括号树
    [CQOI2007]余数求和
    CF1000E We Need More Bosses
    [HAOI2009]毛毛虫
    ls命令
    HTML的标签 属性 等等
    虚拟机安装Tools
    1.1 什么是安全渗透
    004-Kali Linux安装-熟悉环境
    003-Kali Linux 安装-持久加密USB安装、熟悉环境、熟悉BASH命令
  • 原文地址:https://www.cnblogs.com/jiongyy0570/p/10290847.html
Copyright © 2011-2022 走看看