/ SeriousOJ /

Record Detail

Accepted


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

Code

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

void solve() {
    ll n = 3;
    set<ll> st;
    vector<ll> v;
    while(n--) {
        ll x;
        cin >> x;
        v.push_back(x);
        st.insert(x);
    }
    sort(v.begin(), v.end());
    if(v[0] + v[1] <= v[2]) cout << "Not a triangle" << endl;
    else if(st.size() == 3) cout << "Scalene" << endl;
    else if(st.size() == 2) cout << "Isosceles" << endl;
    else cout << "Equilateral" << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    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:35:18
Judged At
2025-02-17 14:35:18
Judged By
Score
100
Total Time
2ms
Peak Memory
540.0 KiB