当前位置:网站首页>7-25 read numbers (loop switch)
7-25 read numbers (loop switch)
2022-07-03 01:35:00 【Big fish】
Enter an integer , Output the Pinyin corresponding to each number . When the integer is negative , First, the output fu word . The Pinyin corresponding to ten numbers is as follows :
0: ling
1: yi
2: er
3: san
4: si
5: wu
6: liu
7: qi
8: ba
9: jiu
Input format :
Input gives an integer on a line , Such as :1234.
Tips : Integers include negative numbers 、 Zero and positive .
Output format :
Output the Pinyin corresponding to the integer in one line , The Pinyin of each number is separated by a space , There is no final space at the end of the line . Such as yi er san si.
sample input :
-600
No blank lines at the end
sample output :
fu liu ling ling
No blank lines at the end
There are two ways to achieve this :
Code 1:
#include<stdio.h>
int main()
{
int num = 0;
int a[11] = { 0 };
scanf("%d", &num);
if (num < 0)
{
printf("fu ");
num *= -1;
}
if (num == 0)
{
printf("ling");
}
int k = 0,i=0;
while (num)// Store each bit of data in the array .
{
a[i] = num % 10;
i++;
num /= 10;
}
k = --i;
for(int i=k;i>=0;i--)// Print each bit in turn , Last, don't print spaces
{
switch (a[i])
{
case 0:
if (i == 0)
{
printf("ling");
break;
}
printf("ling ");
break;
case 1:
if (i == 0)
{
printf("yi");
break;
}
printf("yi ");
break;
case 2:
if (i == 0)
{
printf("er");
break;
}
printf("er ");
break;
case 3:
if (i == 0)
{
printf("san");
break;
}
printf("san ");
break;
case 4:
if (i == 0)
{
printf("si");
break;
}
printf("si ");
break;
case 5:
if (i == 0)
{
printf("wu");
break;
}
printf("wu ");
break;
case 6:
if (i == 0)
{
printf("liu");
break;
}
printf("liu ");
break;
case 7:
if (i == 0)
{
printf("qi");
break;
}
printf("qi ");
break;
case 8:
if (i == 0)
{
printf("ba");
break;
}
printf("ba ");
break;
case 9:
if (i == 0)
{
printf("jiu");
break;
}
printf("jiu ");
break;
}
}
return 0;
}result :

test result :

Code 2:
#include<stdio.h>
int main()
{
int num = 0;
scanf("%d", &num);
if (num < 0)
{
printf("fu ");
num *= -1;
}
if (num == 0)
printf("ling");
int t = num;
int i = 1;
while (num)// This part is about num Figure out the number of digits
{
i *= 10;
num /= 10;
}
i = i / 10;
int m = 0,d=0;
while(i)// Print directly from the top
{
m = t / i;
d = m % 10;
i /= 10;
switch (d)
{
case 0:
if (i == 0)
{
printf("ling");
break;
}
printf("ling "); break;
case 1:
if (i == 0)
{
printf("yi");
break;
}
printf("yi "); break;
case 2:
if (i == 0)
{
printf("er");
break;
}
printf("er "); break;
case 3:
if (i == 0)
{
printf("san");
break;
}
printf("san "); break;
case 4:
if (i == 0)
{
printf("si");
break;
}
printf("si "); break;
case 5:
if (i == 0)
{
printf("wu");
break;
}
printf("wu "); break;
case 6:
if (i == 0)
{
printf("liu");
break;
}
printf("liu "); break;
case 7:
if (i == 0)
{
printf("qi");
break;
}
printf("qi "); break;
case 8:
if (i == 0)
{
printf("ba");
break;
}
printf("ba "); break;
case 9:
if (i == 0)
{
printf("jiu");
break;
}
printf("jiu "); break;
}
}
return 0;
}
test result :

The problem itself is not difficult , It's easy to grasp the printing order of this problem , In fact, I have learned data structure , Stack to achieve the best .
边栏推荐
- [system analyst's road] Chapter V double disk software engineering (development model development method)
- C#应用程序界面开发基础——窗体控制(4)——选择类控件
- JDBC courses
- 如今少年已归来,人间烟火气最抚凡人心 复工了~
- d,ldc構建共享庫
- Three core issues of concurrent programming - "deep understanding of high concurrent programming"
- Kivy tutorial - example of using Matplotlib in Kivy app
- Thinkphp+redis realizes simple lottery
- C语言课程信息管理系统
- Create your first Kivy program Hello word (tutorial includes source code)
猜你喜欢

Basic concept and implementation of overcoming hash

High resolution network (Part 1): Principle Analysis

力扣 204. 计数质数

After reading this article, I will teach you to play with the penetration test target vulnhub - drivetingblues-9
![[Androd] Gradle 使用技巧之模块依赖替换](/img/5f/968db696932f155a8c4a45f67135ac.png)
[Androd] Gradle 使用技巧之模块依赖替换

What is tone. Diao's story
![[error record] the shutter component reports an error (no directionality widget found. | richtext widgets require a directionality)](/img/3c/93ef853784d4e7cef63f30be0b0bf2.jpg)
[error record] the shutter component reports an error (no directionality widget found. | richtext widgets require a directionality)

一位苦逼程序员的找工作经历

Dotconnect for PostgreSQL data provider

SSL flood attack of DDoS attack
随机推荐
MySQL basics 03 introduction to MySQL types
dotConnect for PostgreSQL数据提供程序
MySQL foundation 04 MySQL architecture
VIM 9.0 is officially released! The execution speed of the new script can be increased by up to 100 times
Uniapp component -uni notice bar notice bar
How is the mask effect achieved in the LPL ban/pick selection stage?
MySQL foundation 07-dcl
[Androd] Gradle 使用技巧之模块依赖替换
[understanding of opportunity -36]: Guiguzi - flying clamp chapter - prevention against killing and bait
Dotconnect for PostgreSQL data provider
Button wizard play strange learning - automatic return to the city route judgment
Related concepts of GDB in embedded system
[my advanced journey of OpenGL learning] collation of Euler angle, rotation order, rotation matrix, quaternion and other knowledge
【C语言】指针与数组笔试题详解
2022 cable crane driver examination registration and cable crane driver certificate examination
Mathematical knowledge: Nim game game theory
Vim 9.0正式发布!新版脚本执行速度最高提升100倍
数学知识:Nim游戏—博弈论
对非ts/js文件模块进行类型扩充
Leetcode 6103 - minimum fraction to delete an edge from the tree