YTU OJ Problem 1923

YTU OJ Problem 1923 ASCII码排序

题目描述
输入三个字符后，按各字符的ASCII码从小到大的顺序输出这三个字符。

输入
输入数据有多组，每组占一行，有三个字符组成，之间无空格。

输出
对于每组输入数据，输出一行，字符中间用一个空格分开。

输入输出样例
样例输入 #1
qwe
asd
zxc
样例输出 #1
e q w
a d s
c x z
提示
%*c 可以忽略行尾多余的换行符

C：

#include<stdio.h>
int main()
{
	char ch1, ch2, ch3, x0;
	while(scanf("%c%c%c" , &ch1, &ch2, &ch3) != EOF)
	{
		if (ch1 > ch2&& ch1 > ch3 && ch2 > ch3)
		{
			printf("%c %c %c", ch3, ch2, ch1);
		}
		else if (ch1 > ch2&& ch1 > ch3 && ch2 < ch3)
		{
			printf("%c %c %c", ch2, ch3, ch1);
		}
		else if (ch2 > ch1&& ch2 > ch3 && ch3 > ch1)
		{
			printf("%c %c %c", ch1, ch3, ch2);
		}
		else if (ch2 > ch1&& ch2 > ch3 && ch3 < ch1)
		{
			printf("%c %c %c", ch3, ch1, ch2);
		}
		else if (ch3 > ch2&& ch3 > ch1 && ch2 > ch1)
		{
			printf("%c %c %c", ch1, ch2, ch3);
		}
		else
		{
			printf("%c %c %c", ch2, ch1, ch3);
		}
		scanf("%c", &x0);//输入一个回车字符
	}
	return 0;
}

C++：

#include<iostream>
int main()
{
	using namespace std;
	char ch1, ch2, ch3;
	while(cin >> ch1 >> ch2 >> ch3)
	{
		if (ch1 > ch2&& ch1 > ch3 && ch2 > ch3)
		{
			cout << ch3 << " " << ch2 << " " << ch1 << endl;
		}
		else if (ch1 > ch2&& ch1 > ch3 && ch2 < ch3)
		{
			cout << ch2 << " " << ch3 << " " << ch1 << endl;
		}
		else if (ch2 > ch1&& ch2 > ch3 && ch3 > ch1)
		{
			cout << ch1 << " " << ch3 << " " << ch2 << endl;
		}
		else if (ch2 > ch1&& ch2 > ch3 && ch3 < ch1)
		{
			cout << ch3 << " " << ch1 << " " << ch2 << endl;
		}
		else if (ch3 > ch2&& ch3 > ch1 && ch2 > ch1)
		{
			cout << ch1 << " " << ch2 << " " << ch3 << endl;
		}
		else
		{
			cout << ch2 << " " << ch1 << " " << ch3 << endl;
		}
		getchar();//输入回车
	}
	return 0;
}