题目描述

不会排序

样例

```

include [HTML_REMOVED]

using namespace std;

double a[3];

bool cmp(double a, double b) {return a > b;} //降序

int main()
{
for(int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3, cmp);

double A = a[0], B = a[1], C = a[2];
// cout << A << B << C;
if(A >= B + C)
    puts("NAO FORMA TRIANGULO");
else
{
    if(A * A == B * B + C * C) puts("TRIANGULO RETANGULO");
    if(A * A > B * B + C * C) puts("TRIANGULO OBTUSANGULO");
    if(A * A < B * B + C * C) puts("TRIANGULO ACUTANGULO");
    if(A == B && B == C ) puts("TRIANGULO EQUILATERO");
    if((A == B || B == C) && (A != B || B != C)) puts("TRIANGULO ISOSCELES");
}
return 0;

}