/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 324.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Accepted 1ms 532.0 KiB
#8 Accepted 1ms 532.0 KiB
#9 Accepted 1ms 508.0 KiB
#10 Accepted 1ms 432.0 KiB
#11 Accepted 1ms 532.0 KiB
#12 Accepted 1ms 532.0 KiB
#13 Accepted 1ms 532.0 KiB
#14 Accepted 1ms 376.0 KiB
#15 Accepted 1ms 532.0 KiB
#16 Accepted 1ms 532.0 KiB
#17 Accepted 1ms 524.0 KiB
#18 Accepted 1ms 432.0 KiB
#19 Accepted 1ms 488.0 KiB
#20 Accepted 1ms 532.0 KiB
#21 Accepted 1ms 532.0 KiB
#22 Accepted 1ms 532.0 KiB
#23 Accepted 1ms 532.0 KiB
#24 Accepted 1ms 484.0 KiB
#25 Accepted 1ms 532.0 KiB
#26 Accepted 1ms 532.0 KiB
#27 Accepted 1ms 532.0 KiB
#28 Accepted 1ms 532.0 KiB
#29 Accepted 1ms 332.0 KiB
#30 Accepted 1ms 404.0 KiB

Code

#include <bits/stdc++.h>

using namespace std;

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

}

int32_t main() {
  ios::sync_with_stdio(!cin.tie(0));
  int t = 1;
  // cin >> t;
  for (int i = 1; i <= t; ++i) {
    solve(i);
  }
  return 0;
}

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:34:22
Judged At
2025-02-17 14:34:22
Judged By
Score
100
Total Time
1ms
Peak Memory
532.0 KiB