当前位置:网站首页>C language instance_ four
C language instance_ four
2022-07-07 01:24:00 【Vicky__ three thousand and twenty-one】
1. Scheduling problem
Arrange the ten numbers from large to small .
#include<stdio.h>
int main(void)
{
int i,j,t,a[11];
for(i=1;i<11;i++){
scanf("%d",&a[i]);
}
for(i=1;i<=9;i++){
for(j=i+1;j<=10;j++){
if(a[i]<a[j]){
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
for(i=1;i<=10;i++){
printf("%d ", a[i]);
}
printf("\n");
return 0;
}
2. Look up integers
Give a containing n A sequence of integers , Ask for integers a The first occurrence in a sequence is the number of .
#include<stdio.h>
int main(void)
{
int m,n,i,j;
scanf("%d",&m);
int a[m];
for(j=0;j<m;j++){
scanf("%d ",&a[j]);
}
scanf("%d",&n);
for(i=0;i<=m;i++){
if(a[i]==n){
printf("%d",i+1);
return 0;
}
}
printf("-1");
return 0;
}
3. Calculate the maximum value of the element in the array and its row and column subscript value
Press the function prototype below to program and input a from the keyboard m That's ok n Two dimensional array of columns , Then calculate the maximum value of the elements in the array and the subscript value of the row and column . among m and n The value of is entered by the user keyboard . It is known that m and n No more than 10.
#include<stdio.h>
int main(void)
{
int a[10][10];
int max,row,col,i,j,m,n;
row = col - 1;
printf("Input m, n:");
scanf("%d,%d",&m,&n);
printf("Input %d*%d array:\n",m,n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
max = a[0][0];
for(i=0;i<m;i++){
for(j=0;j<n;j++){
if(a[i][j]>max){
max=a[i][j];
row=i+1;
col=j+1;
}
}
}
if(m==1){
max=1;
row=1;
col=1;
}
printf("max=%d, row=%d, col=%d",max,row,col);
return 0;
}
4. Delete maximum
Input 10 Different integers are stored in the array , Find the largest element and delete it , Output the deleted array
#include<stdio.h>
#define N 10
int a[N];
int main(void){
int i;
for(i = 0;i < N;i++){
scanf("%d",&a[i]);
}
int maxa = a[0], k = 0;
for(i = 1;i < N;i++){
if(a[i]>maxa) maxa = a[i], k=i;
}
for(i = 0;i < N;i++){
if(i != k){
printf("%d ",a[i]);
}
}
printf("\n");
return 0;
}
5. Yang hui triangle
Remember the Yanghui triangle I learned in middle school ? The specific definition will not be described here , You can refer to the figure below :
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
#include<stdio.h>
int a[10][10];
int main()
{
int num = 1;
for(int i = 0; i < 10; i ++) a[i][0] = 1;
for(int i = 1; i < 10; i ++)
{
for(int j = 1; j < 10; j ++)
{
if(j == num)
{
num ++;
a[i][j] = 1;
break;
}
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
}
}
num = 1;
for(int i = 0; i < 10; i ++)
{
for(int j = 0; j < 10; j ++)
{
if(j == num)
{
num ++;
break;
}
if(j == num - 1) printf("%d", a[i][j]);
else printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
}
边栏推荐
- What are the differences between Oracle Linux and CentOS?
- LLDP兼容CDP功能配置
- 如何管理分布式团队?
- 资产安全问题或制约加密行业发展 风控+合规成为平台破局关键
- Neon Optimization: About Cross access and reverse cross access
- Atomic in golang, and cas Operations
- 移植DAC芯片MCP4725驱动到NUC980
- Neon Optimization: performance optimization FAQ QA
- 安利一波C2工具
- Installation of gazebo & connection with ROS
猜你喜欢
UI control telerik UI for WinForms new theme - vs2022 heuristic theme
让我们,从头到尾,通透网络I/O模型
ARM裸板调试之JTAG原理
[signal and system]
Transformation transformation operator
Force buckle 1037 Effective boomerang
微信公众号发送模板消息
Windows installation mysql8 (5 minutes)
Yunna | work order management measures, how to carry out work order management
Installation of gazebo & connection with ROS
随机推荐
7.6 simulation summary
安利一波C2工具
Supersocket 1.6 creates a simple socket server with message length in the header
C language - array
Grc: personal information protection law, personal privacy, corporate risk compliance governance
C# 计算农历日期方法 2022
golang中的atomic,以及CAS操作
[signal and system]
mysql: error while loading shared libraries: libtinfo. so. 5: cannot open shared object file: No such
Wood extraction in Halcon
Dark horse notes - exception handling
[hfctf2020]babyupload session parsing engine
Neon Optimization: performance optimization FAQ QA
pyflink的安装和测试
Oracle:CDB限制PDB资源实战
NEON优化:log10函数的优化案例
机器学习:随机梯度下降(SGD)与梯度下降(GD)的区别与代码实现。
JTAG principle of arm bare board debugging
Yunna | work order management measures, how to carry out work order management
THREE.AxesHelper is not a constructor