/ SeriousOJ /

Record Detail

Accepted


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

Code

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;

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

    map < ll, ll > mp;
    vector < ll > arr(3);
    for (ll i = 0; i < 3; i++) {
        ll x;
        cin >> x;
        arr[i] = x;
        mp[x]++;
    }

    if (arr[0] + arr[1] > arr[2] && arr[1] + arr[2] > arr[0] && arr[2] + arr[0] > arr[1]) {
        if (mp.size() == 3) cout << "Scalene\n";
        else if (mp.size() == 2) cout << "Isosceles\n";
        else cout << "Equilateral\n";
    }
    else cout << "Not a triangle\n";




    return 0;
}
// Author : Raj (raj_singh35)

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:33:30
Judged At
2025-02-17 14:33:30
Judged By
Score
100
Total Time
6ms
Peak Memory
768.0 KiB