百练 2883 Checking order

来源:互联网 发布:spring sql注入拦截器 编辑:程序博客网 时间:2024/06/05 03:53

题目链接:http://bailian.openjudge.cn/practice/2883

# include <stdio.h>int main(){int num[5];int i,j,t,f;while(scanf("%d%d%d%d%d",&num[0],&num[1],&num[2],&num[3],&num[4])==5){f=0;for(i=0;i<4;i++)if(num[i]>num[i+1])f++;if(f!=0){printf("No");for(i=0;i<4;i++)for(j=0;j<4-i;j++)if(num[j]>num[j+1]){t=num[j];num[j]=num[j+1];num[j+1]=t;}for(i=0;i<5;i++)printf(" %d",num[i]);printf("\n");}elseprintf("Yes\n");}return 0;}

注:”==5“  ”<4“

原创粉丝点击