pta basin 1002

    xiaoxiao2021-03-25  74

    #include <cstdio> #include <cstring> #include <string> #include <algorithm> #include <queue> #include <map> #include <cmath> #include <iostream> #include <set> #include <vector> #define INF 0x3f3f3f3f using namespace std; const int N=1e5+5; typedef long long ll; map<char,string> q; int main() { char s[105]; q['1']="yi"; q['2']="er"; q['3']="san"; q['4']="si"; q['5']="wu"; q['6']="liu"; q['7']="qi"; q['8']="ba"; q['9']="jiu"; q['0']="ling"; scanf("%s",s); int num=0; for(int i=0;s[i];i++) num+=s[i]-'0'; sprintf(s,"%d",num); cout<<q[s[0]]; for(int i=1;s[i];i++) cout<<" "<<q[s[i]]; }
    转载请注明原文地址: https://ju.6miu.com/read-35539.html

    最新回复(0)