当前位置:网站首页>【C语言】 题集 of Ⅸ
【C语言】 题集 of Ⅸ
2022-07-06 20:10:00 【InfoQ】
write in front
第四十一题→数字每一位之和『递归』
sum += n % 10;//求个位sum = sum + n % 10
n = n / 10; //把个位抹去
第四十二题→冒泡排序
第四十三题→学习小组
第四十四题→正整数的相乘
第四十五题→数组元素交换
第四十一题の代码
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int print(unsigned int n)
{
//这里之所以是n>9是因为n<10的话无论我们输入什么数字都是最终相加之和
if (n > 9)
{
//取模得到个位,除以得到十位。
return print(n / 10) + n % 10;
}
else
{
return n;
}
}
int main(void)
{
unsigned int num = 0;
printf("请输入数字→");
scanf("%d", &num);
int ret = print(num);
printf("ret = %d\n", ret);
return 0;
}
第四十二题の代码
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
void Bubble_Sort(int arr[],int sz)
{
int i = 0;
//确定排序的次数
for (i = 0; i < sz - 1; i++)
{
//每次交换的次数,第一次交换次数n-1,依次......
int j = 0;
//防止无效循环,也就是当我们数组已经是冒泡排序的情况。
int flag = 1;
//确定交换的次数。
for (j = 0; j < sz - 1 - i; j++)
{
//第一个数字和第二个数字比较,当第一个数字大于第二个数字时候进行交换。
if (arr[j] > arr[j + 1])
{
//创建临时变量,进行交换!
int change;
change = arr[j];
arr[j] = arr[j+1];
arr[j+1] = change;
flag = 0;
}
}
if (flag == 1)
{
break;
}
}
}
int main(void)
{
int i = 0;
//数组的逆序排序
int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
//sz是数组总元素的大小
int sz = sizeof(arr) / sizeof(arr[0]);
//调用函数
Bubble_Sort(arr,sz);
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
第四十三题の代码
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main()
{
int i = 0;
int j = 0;//循环初始化下标
int arr[3][5] = { 0 };//行-科目,列-学生。
int sum = 0; //当前科目的总成绩
int average = 0; //总平均分
int v[3]; //各科平均数
printf("请输入各科学生的成绩:\n");
for (i = 0; i < 3; i++)
{
printf("\n一门学科数入5次成绩\n");
if (i == 0)
printf("数学学科:");
if (i == 1)
printf("语文学科:");
if (i == 2)
printf("英语学科:");
for (j = 0; j < 5; j++)
{
scanf("%d", &arr[i][j]); //输入每个同学的各科成绩
sum += arr[i][j]; //计算当前科目的总成绩(sum)
}
v[i] = sum / 5; // 当前科目的平均分,用总的成绩除以5
sum = 0; // 把当前科目总成绩清0
}
printf("\n数学成绩 = %d\n语文成绩 = %d\n英语成绩 = %d\n", v[0], v[1], v[2]);
average = v[0] + v[1] + v[2];
printf("平均分: %d\n", average / 3);
return 0;
}
第四十四题の代码
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int Multiply(int a, int b)
{
if (b == 0)
{
return 0;
}
return a + Multiply(a, b - 1);// a + a * b
}
int main(void)
{
int i = 0;
int j = 0;
printf("请输入两个数字:");
scanf("%d %d", &i, &j);
Multiply(i, j);
printf("%d\n", Multiply(i, j));
return 0;
}
第四十五题の代码
#include<stdio.h>
#define number 5
int main(void)
{
int i = 0;
int arr1[number] = { 1, 3, 5, 7, 9 };
int arr2[number] = { 2, 4, 6, 8, 10 };
for (i = 0; i < number; i++)
{
printf("没交换之前的值:arr1[%d] = %d\n",i + 1, arr1[i]);
}
for (i = 0; i < number; i++)
{
printf("没交换之前的值:arr2[%d] = %d\n", i + 1, arr2[i]);
}
printf("\n");
int sz = sizeof(arr1) / sizeof(arr1[0]);
for (i = 0; i < sz; i++)
{
int tmp;
tmp = arr1[i];
arr1[i] = arr2[i];
arr2[i] = tmp;
printf("arr1[%d] = %-2d ", i + 1, arr1[i]);
printf("arr2[%d] = %-2d\n", i + 1, arr2[i]);
}
return 0;
}
边栏推荐
- The solution of unable to create servlet file after idea restart
- The whole process of knowledge map construction
- [dream database] add the task of automatically collecting statistical information
- [socket] ① overview of socket technology
- leetcode
- When you go to the toilet, you can clearly explain the three Scheduling Strategies of scheduled tasks
- sshd[12282]: fatal: matching cipher is not supported: [email protected] [preauth]
- 上个厕所的功夫,就把定时任务的三种调度策略说得明明白白
- 2022.6.28
- Hazel engine learning (V)
猜你喜欢
input_delay
Make (convert) ICO Icon
「小样本深度学习图像识别」最新2022综述
Unity uses maskablegraphic to draw a line with an arrow
Hazel engine learning (V)
体会设计细节
2022 spring recruitment begins, and a collection of 10000 word interview questions will help you
Shangsilicon Valley JVM Chapter 1 class loading subsystem
Construction of knowledge map of mall commodities
input_ delay
随机推荐
Left value, right value
Lost in the lock world of MySQL
HDU 4337 King Arthur&#39;s Knights 它输出一个哈密顿电路
Intelligent static presence detection scheme, 5.8G radar sensing technology, human presence inductive radar application
2022 spring recruitment begins, and a collection of 10000 word interview questions will help you
简单冒泡排序
OC, OD, push-pull explanation of hardware
Utilisation de la promesse dans es6
Construction of knowledge map of mall commodities
[colmap] 3D reconstruction with known camera pose
[swift] learning notes (I) -- familiar with basic data types, coding styles, tuples, propositions
杰理之关于 DAC 输出功率问题【篇】
SSL证书错误怎么办?浏览器常见SSL证书报错解决办法
【colmap】已知相机位姿情况下进行三维重建
迷失在MySQL的锁世界
Analysis of USB network card sending and receiving data
Significance and measures of source code confidentiality
c语言字符串排序
leetcode
杰理之在非蓝牙模式下,手机连接蓝牙不要跳回蓝牙模式处理方法【篇】