当前位置:网站首页>Minimum number of C language
Minimum number of C language
2022-07-02 09:44:00 【FF small confused acridine~】
Keyboard entry N(N ≤ 20) individual 0-9 Numbers , You can arrange these numbers in any order , But all must be used . The goal is to make the final number as small as possible ( Be careful 0 Can't be the first ).
for example :
Given two 0, Two 1, Three 5, One 8, The smallest number we get is 10015558.
Programming requirements :
1、N The value of :N ≤ 20;
2、 The entered number contains at least one non-zero number ;
3、 Please use array to realize ;
4、 Please output strictly according to the output effect ;( Affect the performance evaluation )
5、 When submitting the code of the task, it is necessary to ensure that it conforms to the industry code specification , You need to indent and wrap as necessary .( Affect the performance evaluation )
Running effect 1:
Please enter the number of numbers N:6
Please enter 6 A digital :0 1 7 2 0 3
The minimum number of components is :100237
Please press any key to continue . . .
Running effect 2:
Please enter the number of numbers N:8
Please enter 8 A digital :0 1 5 5 8 1 0 5
The minimum number of components is :10015558
Please press any key to continue . . .
#include <stdio.h>
int main(void)
{
int N ,arr[20] ,i ,j ,temp;
printf(" Please enter the number of numbers N:");
scanf("%d" ,&N);
printf(" Please enter %d A digital :", N);
for (i = 0; i < N; i++)
scanf("%d" ,&arr[i]);
for (i = 0; i < N - 1; i++)
for(j = 0; j < N - i -1 ; ++j)
{
if(arr[j] > arr[j+1])
{
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
for (i = 0; i < N; i++)
if(arr[i] != 0)
{
temp = arr[i];
arr[i] = arr[0];
arr[0] = temp;
break;
}
printf(" The minimum number of components is :" );
for (i = 0; i < N; i++)
printf("%d" ,arr[i]);
printf("\n");
return 0;
}
#include <stdio.h>
int main(void)
{
int a[21];
int n,i,j,m;
printf(" Please enter the number of numbers N: ");
scanf("%d",&n);
printf(" Please enter %d A digital : ",n);
for(i=0;i<n;++i){
scanf("%d",&a[i]);
}
for(i=0;i<n-1;++i){
for(j=0;j<n-1;++j){
if(a[j]>a[j+1]){
m=a[j];
a[j]=a[j+1];
a[j+1]=m;
}
}
}
for(i=0;a[i]==0;++i);
m=a[i];
a[i]=a[0];
a[0]=m;
printf(" The smallest number of components is : ");
for(i=0;i<n;++i){
printf("%d",a[i]);
}
printf("\n");
return 0;
}
边栏推荐
- BugkuCTF-web24(解题思路及步骤)
- Say goodbye to 996. What are the necessary plug-ins in idea?
- Chrome browser plug-in fatkun installation and introduction
- 互联网API接口幂等设计
- Solutions to Chinese garbled code in CMD window
- Chrome video download Plug-in – video downloader for Chrome
- Methods of classfile
- C语言之二进制与十进制
- C语言之判断直角三角形
- Cmake command - Official Document
猜你喜欢

Fragmenttabhost implements the interface of housing loan calculator

Kinect DK obtains color RGB images in cv:: mat format (used in openpose)

图像识别-数据增广

Customize redis connection pool

tinyxml2 读取和修改文件

2837xd 代码生成——补充(3)

三相并网逆变器PI控制——离网模式

Failed to configure a DataSource: ‘url‘ attribute is not specified and no embedd

ZK configuration center -- configuration and use of config Toolkit

c语言编程题
随机推荐
What are the differences between TP5 and laravel
Insight into cloud native | microservices and microservice architecture
Alibaba /热门json解析开源项目 fastjson2
JDBC回顾
Image recognition - data augmentation
企业级SaaS CRM实现
Knife4j 2. Solution to the problem of file control without selection when uploading x version files
Creation and jump of activity
Required request body is missing: (cross domain problem)
MySQL multi column in operation
Methods of classfile
Mysql 多列IN操作
Difference between redis serialization genericjackson2jsonredisserializer and jackson2jsonredisserializer
Timed thread pool implements request merging
Int to string, int to qstring
2837xd 代码生成——补充(1)
vs+qt 设置应用程序图标
Beats (filebeat, metricbeat), kibana, logstack tutorial of elastic stack
ZK configuration center -- configuration and use of config Toolkit
Image recognition - data annotation