题解归档 - cf535A

本文由 cf-code 本地题解库自动归档；公开内容以本地 AC/验证版本为准。

• 本地编号：cf535A
• 本地来源：problems/cf535A/idea.md
• 题目链接：https://codeforces.com/contest/535/problem/A
• 原始标题：cf535A Tavas and Nafas

思路

cf535A Tavas and Nafas

题意

把 0–99 的整数输出成英文小写单词；21–99 中非整十数用连字符，如 ninety-nine。

做法

两张查表：a[0..19] 覆盖 zero 到 nineteen；b[2..9] 存整十词。若 s<20 直接输出 a[s]，否则输出 b[s/10]，个位非零再拼 "-"+a[s%10]。

验证

样例 6/20/99 + 边界 0/21，WSL 编译运行通过（Kali 暂不可达）。

代码

来源：problems/cf535A/solution.cpp

/* Author: likely
 * Time: 2026-06-08 04:19:06
**/
#include<bits/stdc++.h>
#define ll long long
using namespace std;
string a[20]={"zero","one","two","three","four","five","six","seven","eight","nine","ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen"};
string b[10]={"","","twenty","thirty","forty","fifty","sixty","seventy","eighty","ninety"};
string ans;
int main(){
    ll s;
    cin>>s;
    if(s<20) ans=a[s];
    else{
        ans=b[s/10];
        if(s%10) ans=ans+"-"+a[s%10];
    }
    cout<<ans<<endl;
    return 0;
}