-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1082.cpp
55 lines (53 loc) · 1.28 KB
/
1082.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//
// 1082.cpp
// 算法
//
// Created by 王怡凡 on 2017/8/29.
// Copyright © 2017年 王怡凡. All rights reserved.
//
#include <stdio.h>
#include<cstring>
using namespace std;
char str[12];
char num[10][5] = {"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
char wei[5][5] = {"Shi","Bai","Qian","Wan","Yi"};
int main() {
gets(str);
int len = int(strlen(str));
int left = 0, right = len-1;
if(str[0]=='-') {
printf("Fu");
left++;
}
while(right-4>=left) {
right -= 4;
}
while(left<len){
bool flag = false;
bool isPrint = false;
while(left<=right) {
if(left>0&&str[left]=='0') {
flag = true;
} else {
if(flag==true){
printf(" ling");
flag = false;
}
if(left>0) {
printf(" ");
}
printf("%s", num[str[left]-'0']);
isPrint = true;
if(left!=right) {
printf(" %s",wei[right-left-1]);
}
}
left++;
}
if(isPrint==true&&right!=len-1) {
printf(" %s",wei[(len-1-right)/4+2]);
}
right+=4;
}
return 0;
}