当前位置:网站首页>7-23 currency conversion (using array conversion)
7-23 currency conversion (using array conversion)
2022-07-03 14:14:00 【Big fish】
Enter an integer ( The number of digits does not exceed 9 position ) Represents a RMB value ( The unit is yuan ), Please convert to the capital Chinese format required by the financial department . Such as 23108 element , Transformed into “ Twenty three thousand one hundred and eight ” element . To simplify the output , In lowercase a-j The order represents capital numbers 0-9, use S、B、Q、W、Y Each represents ten 、 hundred 、 Thousand 、 ten thousand 、 Billion . therefore 23108 The element should be converted to output “cWdQbBai” element .
Input format :
The input gives no more than 9 A nonnegative integer of bits .
Output format :
Output the converted result in one line . Be careful “ zero ” The usage of must conform to Chinese habits .
sample input 1:
813227345
sample output 1:
iYbQdBcScWhQdBeSf
sample input 2:
6900
sample output 2:
gQjBSolution 1 :
#include <stdio.h>
int main()
{
int i=0,j,n;
scanf("%d",&n);
char a[9];
char b[9]={'\n','S','B','Q','W','S','B','Q','Y'}; // The names of bits are stored in the array b
if(n==0){
printf("a\n");
} else{
while(n!=0){ // Numbers are stored in arrays a
a[i]=n%10;
n=n/10;
i++;
}
i=i-1;
for(;i>=0;i--){ // Array a Reverse output
if(a[i]==0){
if(i==4){ // Wan Weiwei 0 The situation of
if(a[8]!=0 && a[7]+a[6]+a[5]+a[4]==0 ){ // There are 100 million , And all ten thousand bits are zero
printf("a"); // Output a zero ( Such as 100004800)
}else{
printf("W"); // No, if there are ten thousand bits on the side, one ten thousand will be output .
}
}else{
if(a[i-1]==0){ // repeat 0 No output
continue;
}else{ // General 0 Output zero , No bit name
printf("a");
}
}
}else{
printf("%c%c",a[i]+'a',b[i]);
}
}
}
return 0;
}summary :
There is an array of numbers , There is an array of digit names . Reverse output two arrays from large to small .
The other is the determination of reading rules .
Solution 2 :
#include <stdio.h>
#include <string.h>
int main()
{
int i,n;
char a[15];
scanf("%s",&a);
char b[9]={'\n','S','B','Q','W','S','B','Q','Y'};
if(a[0]=='0') {printf("a\n"); return 0;}
n=strlen(a);
for(i=0;i<n;i++){
if(a[i]=='0'){
if(i==n-4) printf("W");
if(i<n-1&&a[i+1]=='0'||i==n-1)continue; // The pronunciation of Chinese zero
else printf("a");
}else printf("%c%c",a[i]+'a'-'0',b[n-i-1]);
}
return 0;
}Input the number as a string ( Forward input )
边栏推荐
- protobuf与grpc
- Leetcode (4) -- find the median of two positively ordered arrays
- QT learning 24 layout manager (III)
- [clean up the extraordinary image of Disk C]
- C language,%d% Difference between 2D%2d%02d
- Page generation QR code
- How to bold text in AI
- Too many files with unapproved license
- Leetcode(4)——寻找两个正序数组的中位数
- 虽然不一定最优秀,但一定是最努力的!
猜你喜欢

Configure stylelint

修改数据库中的记录为什么报这个错

jvm-运行时数据区

中感微冲刺科创板:年营收2.4亿净亏1782万 拟募资6亿

Nucleic acid modified metal organic framework drug carrier | pcn-223 metal organic framework encapsulated ad adamantane | zif-8 encapsulated adriamycin (DOX)

GRPC的四种数据流以及案例

Redis:字符串類型數據的操作命令

剑指 Offer 28. 对称的二叉树

Redis:字符串类型数据的操作命令
[email protected]纳米粒子"/>金属有机骨架MIL-88负载阿霉素DOX|叶酸修饰UiO-66-NH2负载阿霉素[email protected]纳米粒子
随机推荐
Nucleic acid modified metal organic framework drug carrier | pcn-223 metal organic framework encapsulated ad adamantane | zif-8 encapsulated adriamycin (DOX)
Leetcode(4)——尋找兩個正序數組的中比特數
Back to top implementation
Too many files with unapproved license
Current situation, analysis and prediction of information and innovation industry
Understanding of closures
Example analysis of QT learning 18 login dialog box
Selenium browser (1)
Zabbix添加Calculated items后保存页面成空白
牛客网:过河卒
QT learning 20 standard dialog box in QT (middle)
Too many files with unapproved license
别再问自己适不适合做软件测试了
Common mixins
Toast UI editor (editor allows you to edit your markup document using text or WYSIWYG, with syntax highlighting, scrolling synchronization, real-time preview and chart functions.)
GRPC的四种数据流以及案例
Scroll detection of the navigation bar enables the navigation bar to slide and fix with no content
Generate directories from web content
[combinatorics] permutation and combination (examples of combinatorial number of multiple sets | three counting models | selection problem | combinatorial problem of multiple sets | nonnegative intege
JS continues to explore...