写出这个数
读入一个正整数 n,计算其各位数字之和,用汉语拼音写出和的每一位数字。
输入格式:
每个测试输入包含 1 个测试用例,即给出自然数 n 的值。这里保证 n 小于 10 100。
输出格式:
在一行内输出 n 的各位数字之和的每一位,拼音数字间有 1 空格,但一行中最后一个拼音数字后没有空格。
输入样例:
1234567890987654321123456789
输出样例:
yi san wu
思路:
利用字符串接收数据,再依次提取相加,最后利用deque接收字符类型,然后输出(最后要将第一个空格消除掉)。
实现:
#include <iostream>
#include <string>
#include <deque>
using namespace std;
void test()
{
string s;
deque<int>d;
cin >> s;
d.resize(s.size());
int a;
for (int i = 0; i < s.size(); ++i)
{
a = ((int)s[i]-48);
d.push_back(a);
}
a = 0;
for (int i = 0; i < d.size(); ++i)
{
a += d[i];
}
deque<char>z;
while (a != 0)
{
int m = a % 10;
a = a / 10;
switch (m)
{
case 1:
{
z.push_front('i');
z.push_front('y');
z.push_front(' ');
break;
}
case 2:
{
z.push_front('r');
z.push_front('e');
z.push_front(' ');
break;
}
case 3:
{
z.push_front('n');
z.push_front('a');
z.push_front('s');
z.push_front(' ');
break;
}
case 4:
{
z.push_front('i');
z.push_front('s');
z.push_front(' ');
break;
}
case 5:
{
z.push_front('u');
z.push_front('w');
z.push_front(' ');
break;
}
case 6:
{
z.push_front('u');
z.push_front('i');
z.push_front('l');
z.push_front(' ');
break;
}
case 7:
{
z.push_front('i');
z.push_front('q');
z.push_front(' ');
break;
}
case 8:
{
z.push_front('a');
z.push_front('b');
z.push_front(' ');
break;
}
case 9:
{
z.push_front('u');
z.push_front('i');
z.push_front('j');
z.push_front(' ');
break;
}
case 0:
{
z.push_front('g');
z.push_front('n');
z.push_front('i');
z.push_front('l');
z.push_front(' ');
break;
}
default:
break;
}
}
z.pop_front();
for (int i = 0; i < z.size(); ++i)
{
cout << z[i];
}
}
int main()
{
test();
return 0;
}