/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Accepted 1ms 536.0 KiB
#8 Accepted 1ms 532.0 KiB
#9 Accepted 1ms 532.0 KiB
#10 Accepted 1ms 360.0 KiB
#11 Accepted 1ms 532.0 KiB
#12 Accepted 1ms 320.0 KiB
#13 Accepted 1ms 532.0 KiB
#14 Accepted 1ms 532.0 KiB
#15 Accepted 1ms 532.0 KiB
#16 Accepted 1ms 368.0 KiB
#17 Accepted 1ms 532.0 KiB
#18 Accepted 1ms 508.0 KiB
#19 Accepted 1ms 348.0 KiB
#20 Accepted 1ms 416.0 KiB
#21 Accepted 1ms 532.0 KiB
#22 Accepted 1ms 532.0 KiB
#23 Accepted 1ms 532.0 KiB
#24 Accepted 1ms 532.0 KiB
#25 Accepted 1ms 328.0 KiB
#26 Accepted 1ms 532.0 KiB
#27 Accepted 1ms 448.0 KiB
#28 Accepted 1ms 480.0 KiB
#29 Accepted 1ms 532.0 KiB
#30 Accepted 1ms 444.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define ld long double
#define ull unsigned long long
#define lcm(a,b) ((a*b)/__gcd(a,b))
const double PI = 2 * acos(0.0);
const int MOD = 1000000007;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int a, b, c;  
    cin >> a >>b >> c;
    vector<int> v = {a, b, c};
    sort(v.begin(), v.end());
    
    if ((v[0] + v[1]) <= v[2] || (v[0] + v[2]) <= v[1] || (v[1] + v[2]) <= v[0]){
        cout << "Not a triangle";
    }
    else if (v[1] != v[0] && v[0] != v[2] && v[1] != v[2]){
        cout << "Scalene";
    }
    else if (v[0] == v[1] && v[1] == v[2]){
        cout << "Equilateral";
    }
    else if (v[0] == v[1] || v[1] == v[2] || v[0] == v[2]){
        cout << "Isosceles";
    }
}

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