蓝桥基础练习 报时助手 BASIC-26

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <cmath>
#include <map>

using namespace std;
typedef long long ll;

#define INF 0x7fffffff
const double inf=1e20;
const int maxn=1000+10;
const int mod=1e7;
const double pi=acos(-1);

char a[60][50]={"zero","one","two","three","four",
                "five","six","seven","eight","nine",
                "ten","eleven","twelve","thirteen","fourteen",
                "fifteen","sixteen","seventeen","eighteen","nineteen",
                "twenty","","","","",
                "","","","","",
                "thirty","","","","",
                "","","","","",
                "forty","","","","",
                "","","","","",
                "fifty","","","","",
                };

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    if(n<=20)printf("%s",a[n]);
    else{
        int n0=n/10*10;
        int n1=n%10;
        printf("%s %s",a[n0],a[n1]);
    }
    printf(" ");
    if(m==0)printf("o‘clock");
    else if(m<=20)printf("%s",a[m]);
    else{
        int m0=m/10*10;
        int m1=m%10;
        printf("%s %s",a[m0],a[m1]);
    }
    printf("\n");
    return 0;
}