-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathT_Is-this-the-easiest-problem.cpp
More file actions
37 lines (36 loc) · 963 Bytes
/
T_Is-this-the-easiest-problem.cpp
File metadata and controls
37 lines (36 loc) · 963 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <iostream>
using namespace std;
int main()
{
int count;
long long int A;
long long int B;
long long int C;
cin >> count;
for (int i = 0; i < count; i++)
{
cin >> A >> B >> C;
if (A > 0 && B > 0 && C > 0)
{
if (A + B > C && B + C > A && A + C > B)
{
if (A == B && B == C && C == A)
{
cout << "Case " << i + 1 << ": Equilateral" << endl;
}
else if (A != B & B != C & C != A)
{
cout << "Case " << i + 1 << ": Scalene" << endl;
}
else
{
cout << "Case " << i + 1 << ": Isosceles" << endl;
}
}
else
cout << "Case " << i + 1 << ": Invalid" << endl;
}
else
cout << "Case " << i + 1 << ": Invalid" << endl;
}
}