1002. 写出这个数 (20)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
读入一个自然数n,计算其各位数字之和,用汉语拼音写出和的每一位数字。
输入格式:每个测试输入包含1个测试用例,即给出自然数n的值。这里保证n小于10100。
输出格式:在一行内输出n的各位数字之和的每一位,拼音数字间有1 空格,但一行中最后一个拼音数字后没有空格。
输入样例:
1234567890987654321123456789
输出样例:
yi san wu
package PATBasic;
import java.util.Scanner;
public class Test1002 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String s = input.next();
String s1[] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"};
String s2 = "";
input.close();
int i, sum = 0;
for (i = 0; i < s.length(); i++) {
sum += s.charAt(i) - '0';
}
if (sum == 0) {
System.out.print(s1[0]);
return;
}
s2 += sum;
for (i = 0; i < s2.length()-1; i++) {
System.out.print(s1[s2.charAt(i)-'0'] +" ");
}
System.out.print(s1[ s2.charAt(i)-'0']);
}
}
package PATBasic;
import java.util.Scanner;
import java.util.Stack;
public class Test1002A {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String s = input.next();
input.close();
int i, sum = 0;
for (i = 0; i < s.length(); i++) {
sum += s.charAt(i) - '0';
}
Stack <String> stack = new Stack();
do {
switch(sum % 10) {
case 1:
stack.push("yi");
break;
case 2:
stack.push("er");
break;
case 3:
stack.push("san");
break;
case 4:
stack.push("si");
break;
case 5:
stack.push("wu");
break;
case 6:
stack.push("liu");
break;
case 7:
stack.push("qi");
break;
case 8:
stack.push("ba");
break;
case 9:
stack.push("jiu");
break;
default :
stack.push("ling");
break;
}
sum /= 10;
} while(sum != 0);
System.out.print(stack.pop());
while(!stack.isEmpty()) {
System.out.print(" " +stack.pop());
}
}
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
int len = s.length();
int *a = new int[len]; //动态分配内存来存储值
int sum = 0;
string str[10] = { "ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"}; //用string存储ling - jiu
for(int i = 0; i < len; i++) //遍历求和
{
a[i] = s[i] - '0';
sum += a[i];
}
int j = 0;
int *b = new int[len];
if(sum == 0) //判断和的值并将其分解存储在b中
{
cout << "ling";
}
else
{
while(sum != 0)
{
b[j++] = sum % 10;
sum = sum / 10;
}
}
for(int i = j-1; i > 0; i--) //遍历输出
cout << str[b[i]] << " ";
cout << str[b[0]];
delete [] a; //释放指针a
delete [] b;//释放指针b
return 0;
}