东方博宜oj1040——1049

1040

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
bool cmp(int a,int b)
{
	return a > b;
}
int main()
{
	int a[3];
	cin >> a[0] >> a[1] >> a[2];
	sort(a, a + 3, cmp);
	for (int i = 0; i < 3; i++)
	{
		cout << a[i] << " ";
	}
}

1041

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
	int a[3];
	for (int i = 0; i < 3; i++)
	{
		cin >> a[i];
	}
	sort(a, a + 3);
	if (a[0] + 1 == a[1] && a[1] + 1 == a[2])
	{
		cout << "TRUE";
	}
	else
	{
		cout << "FALSE";
	}
}

1042

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a, b, c;
	a = n / 100;
	b = n % 100 / 10;
	c = n % 100 % 10;
	int d[3];
	d[0] = a;
	d[1] = b;
	d[2] = c;
	sort(d, d + 3);
	cout << d[2] * 100 + d[1] * 10 + d[0];
}

1043

#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main()
{
	int n;
	cin >> n;
	double num = 0;
	if (n <= 10)
	{
		num = 2.5;
		cout << fixed << setprecision(2) << num;
	}
	if (n > 10)
	{
		num = 1.5 * n - 12.5;
		cout << fixed << setprecision(2) << num;
	}
}

1044

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	if (n < 10)
	{
		cout << 'A';
	}
	else if (n >= 10 && n < 20)
	{
		cout << 'B';
	}
	else if (n >= 20 && n < 40)
	{
		cout << 'C';
	}
	else if (n >= 40 && n < 50)
	{
		cout << 'D';
	}
	else if (n >= 50 && n < 80)
	{
		cout << 'E';
	}
}

1045

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
	int a[3];
	cin >> a[0] >> a[1] >> a[2];
	sort(a, a + 3);
	if (a[0] + a[1] > a[2])
	{
		cout << "Yes";
	}
	else
	{
		cout << "No";
	}
}

1046

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	int a[4];
	for (int i = 0; i < 4; i++)
	{
		cin >> a[i];
	}
	sort(a, a + 4);//升序排列
	if (a[0] + 2 == a[1] && a[1] + 2 == a[2] && a[2] + 2 == a[3])
	{
		cout << a[0] << "+2=" << a[1] << endl;
		cout << a[1] << "+2=" << a[2] << endl;
		cout << a[2] << "+2=" << a[3];
	}
	else
	{
		sort(a, a + 4, cmp);//降序排列
		for (int i = 0; i < 4; i++)
		{
			cout << a[i] << " ";
		}
	}
}

1047

#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
 
int main()
{
	double a[3];
	cin >> a[0] >> a[1] >> a[2];
	sort(a, a + 3);
	if (a[0] + a[1] > a[2] && pow(a[0], 2) + pow(a[1], 2) == pow(a[2], 2))
	{
		cout << fixed << setprecision(1) << a[0] * a[1] / 2.0;
	}
	else
	{
		cout << "No";
	}
}

1048

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int a, b;
	cin >> a >> b;
	if ((a == 1 && b == 2) || (a == 2 && b == 3) || (a == 3 && b == 1))
	{
		cout << "win";
	}
	else if (a == b)
	{
		cout << "tie";
	}
	else
	{
		cout << "lose";
	}
}

1049

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	if (n == 1)
	{
		cout << "one";
	}
	else if (n == 2)
	{
		cout << "two";
	}
	else if (n == 3)
	{
		cout << "three";
	}
	else if (n == 4)
	{
		cout << "four";
	}
	else if (n == 5)
	{
		cout << "five";
	}
	else if (n == 6)
	{
		cout << "six";
	}
	else if (n == 7)
	{
		cout << "seven";
	}
	else if (n == 8)
	{
		cout << "eight";
	}
	else if (n == 9)
	{
		cout << "nine";
	}
	else
	{
		cout << "out";
	}
}