PAT 1005 Spell It Right

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.

由于数字范围为为0~10^100，超出范围整型数字范围，故用字符串代替数字输出，数字为非负，单独考虑为0的情况。代码如下：

#include<iostream>
#include<string>
#define maxsize 101
using namespace std;
int num[maxsize]={0};
void exchange(int n){
    switch (n)
    {
    case 0:
        cout<<"zero";
        break;
    case 1:
        cout<<"one";
        break;
    case 2:
        cout<<"two";
        break;
    case 3:
        cout<<"three";
        break;
    case 4:
        cout<<"four";
        break;
    case 5:
        cout<<"five";
        break;
    case 6:
        cout<<"six";
        break;
    case 7:
        cout<<"seven";
        break;
    case 8:
        cout<<"eight";
        break;
    case 9:
        cout<<"nine";
        break;
    default:
        break;
    }
}
int main()
{
    string n;
    cin>>n;
    int i=0,sum=0;
    int len=n.size();
    for(int p=0;p<len;p++){
        sum+=int(n[p]-'0');
    }
    if(sum==0)
        cout<<"zero";
    else{
        while(sum){
        num[i++]=sum%10;
        sum=sum/10;
        }
        for(int k=i-1;k>=0;k--){
            if(k==i-1)
                exchange(num[k]);
            else{
                cout<<" ";
                exchange(num[k]);
            }
        }
    }
    return 0;
}

结果如下：