当前位置:网站首页>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 .
边栏推荐
- 传输层 TCP主要特点和TCP连接
- Wireshark data analysis and forensics a.pacapng
- Tâche 6: regroupement DBSCAN
- [error record] the shutter component reports an error (no directionality widget found. | richtext widgets require a directionality)
- The latest analysis of tool fitter (technician) in 2022 and the test questions and analysis of tool fitter (technician)
- Canvas drawing -- bingdd
- MySQL - database query - condition query
- 并发编程的三大核心问题 -《深入理解高并发编程》
- Basis of information entropy
- Machine learning terminology
猜你喜欢

Installation and use of serial port packet capturing / cutting tool

C#应用程序界面开发基础——窗体控制(3)——文件类控件

并发编程的三大核心问题 -《深入理解高并发编程》
![[Arduino experiment 17 L298N motor drive module]](/img/e2/4511eaa942e4a64c8ca2ee70162785.jpg)
[Arduino experiment 17 L298N motor drive module]

Telecom Customer Churn Prediction challenge

Expérience de recherche d'emploi d'un programmeur difficile

High-Resolution Network (篇一):原理刨析

Meituan dynamic thread pool practice ideas, open source

传输层 TCP主要特点和TCP连接

CF1617B Madoka and the Elegant Gift、CF1654C Alice and the Cake、 CF1696C Fishingprince Plays With Arr
随机推荐
Thinkphp+redis realizes simple lottery
How is the mask effect achieved in the LPL ban/pick selection stage?
VIM 9.0 is officially released! The execution speed of the new script can be increased by up to 100 times
Androd Gradle 对其使用模块依赖的替换
产业互联网的产业范畴足够大 消费互联网时代仅是一个局限在互联网行业的存在
C#应用程序界面开发基础——窗体控制(2)——MDI窗体
Why can't the start method be called repeatedly? But the run method can?
MySQL basics 03 introduction to MySQL types
Look at how clothing enterprises take advantage of the epidemic
[Arduino experiment 17 L298N motor drive module]
wirehark数据分析与取证A.pacapng
2022 coal mine gas drainage examination question bank and coal mine gas drainage examination questions and analysis
Why is it not recommended to use BeanUtils in production?
[data mining] task 5: k-means/dbscan clustering: double square
什么是调。调的故事
Type expansion of non ts/js file modules
[system analyst's road] Chapter V double disk software engineering (development model development method)
Create your first Kivy program Hello word (tutorial includes source code)
Mathematical knowledge: step Nim game game game theory
MySQL foundation 04 MySQL architecture