原代码:
#include <iostream>
#include<cmath>
#include<iomanip>
#include<string>
using namespace std;
void sort (int *length)
{
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3 - i; j++)//从小到大
{
if (length[j] > length[j + 1])
{
int temp = length[j];
length[j] = length[j + 1];
length[j + 1] = temp;
}
}
}
}
int main()
{
int length[4];
for (int i = 0; i < 4; i++)
{
cin >> length[i];
}
sort(length);
cout << length[0] << length[1] << length[2] << length[3] << endl;
int flag = 0;
for (int i = 0; i < 4; i++)
{
int tempLen[4] = { 0,0,0,0 };
int logo = 0;
for (int j = 0; j < 4; j++)
{
if (j != i)
{
tempLen[logo] = length[j];
logo++;
}
}
//cout << tempLen[0] << tempLen[1] << tempLen[2] << endl;
if (tempLen[0] + tempLen[1] > tempLen[2])
{
flag = 1;
}
else if (tempLen[0] + tempLen[1] == tempLen[2] && flag != 1)
{
flag = 2;
}
}
if (flag == 1)
{
cout << "TRIANGLE";
}
else if (flag == 2)
{
cout << "SEGMENT";
}
else
{
cout << "IMPOSSIBLE";
}
return 0;
}
修改:深搜,以后再写