/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 540.0 KiB
#5 Accepted 1ms 540.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 588.0 KiB
#8 Accepted 1ms 540.0 KiB
#9 Accepted 1ms 332.0 KiB
#10 Accepted 1ms 540.0 KiB
#11 Accepted 2ms 700.0 KiB
#12 Accepted 1ms 540.0 KiB
#13 Accepted 1ms 540.0 KiB
#14 Accepted 1ms 540.0 KiB
#15 Accepted 1ms 540.0 KiB
#16 Accepted 1ms 540.0 KiB
#17 Accepted 1ms 540.0 KiB
#18 Accepted 1ms 540.0 KiB
#19 Accepted 1ms 540.0 KiB
#20 Accepted 1ms 768.0 KiB
#21 Accepted 2ms 540.0 KiB
#22 Accepted 1ms 540.0 KiB
#23 Accepted 1ms 540.0 KiB
#24 Accepted 1ms 540.0 KiB
#25 Accepted 1ms 556.0 KiB
#26 Accepted 2ms 540.0 KiB
#27 Accepted 1ms 540.0 KiB
#28 Accepted 1ms 540.0 KiB
#29 Accepted 1ms 540.0 KiB
#30 Accepted 1ms 540.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void solve(int T) {
	int a[3]; cin >> a[0] >> a[1] >> a[2];
	sort(a, a+3);
	if(a[0] == a[1] && a[1] == a[2]) {
		cout << "Equilateral\n";
	} else if(a[0] == a[1] || a[1] == a[2] || a[2] == a[0]) {
		cout << "Isosceles\n";	
	} else if(a[2] < a[0] + a[1]) {
		cout << "Scalene\n";
	} else {
		cout << "Not a triangle\n";
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
#ifdef MYPC
	cout << "==== OUTPUT ====\n";
#endif
	int t = 1;
	for(int i = 1; i <= t; i++) {
		solve(i);
	}
}

Information

Submit By
Type
Submission
Problem
P1108 Triangle Triangle Triangle!!!
Contest
Brain Booster #8
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-17 14:35:58
Judged At
2025-02-17 14:35:58
Judged By
Score
100
Total Time
2ms
Peak Memory
768.0 KiB