ASCII码排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 62916 Accepted Submission(s): 25796
Problem Description输入三个字符后,按各字符的ASCII码从小到大的顺序输出这三个字符。Input输入数据有多组,每组占一行,有三个字符组成,之间无空格。Output对于每组输入数据,输出一行,字符中间用一个空格分开。Sample Input
qwe asd zxc
Sample Outpute q w a d s c x z
Authorlcy
Source
way 1: sort排序:
#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;char abc[3];int main(){ while(scanf("%s",abc)!=EOF) { sort(abc,abc+3); //printf("%s\n",abc); //cout<<abc[0]<<" "<<abc[1]<<" "<<abc[2]<<endl; printf("%c %c %c\n",abc[0],abc[1],abc[2]); } return 0;}way 2:
#include<stdio.h> void swap(char& a,char& b) { char c; c=a; a=b; b=c; } int main() { char n[4]; while(scanf("%s",&n)!=EOF) { if(n[0]>n[1]) swap(n[0],n[1]); if(n[1]>n[2]) swap(n[1],n[2]); if(n[0]>n[1]) swap(n[0],n[1]); printf("%c %c %c\n",n[0],n[1],n[2]); } return 0; }
HDU2000(ASCII码排序)
最新推荐文章于 2022-01-25 09:01:14 发布