/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Accepted 4ms 532.0 KiB
#5 Accepted 4ms 532.0 KiB
#6 Accepted 4ms 532.0 KiB
#7 Accepted 4ms 532.0 KiB
#8 Accepted 4ms 532.0 KiB
#9 Accepted 4ms 532.0 KiB
#10 Accepted 5ms 480.0 KiB
#11 Accepted 2ms 532.0 KiB
#12 Accepted 1ms 532.0 KiB
#13 Accepted 1ms 528.0 KiB
#14 Accepted 1ms 532.0 KiB
#15 Accepted 1ms 532.0 KiB
#16 Accepted 1ms 324.0 KiB
#17 Accepted 1ms 532.0 KiB
#18 Accepted 1ms 532.0 KiB
#19 Accepted 1ms 532.0 KiB
#20 Accepted 1ms 532.0 KiB
#21 Accepted 1ms 764.0 KiB
#22 Accepted 1ms 340.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 320.0 KiB
#28 Accepted 1ms 320.0 KiB
#29 Accepted 1ms 536.0 KiB
#30 Accepted 1ms 532.0 KiB

Code

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

#define ll long long
#define int long long
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define trace(x) cerr << #x << ": " << x << '\n'
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    vector<int> v(3);
    for (auto &i : v)
        cin >> i;
    sort(all(v));
    if (v[0] + v[1] <= v[2])
        cout << "Not a triangle\n";
    else if (v[0] == v[1] and v[1] == v[2])
        cout << "Equilateral\n";
    else if (v[1] == v[0] or v[1] == v[2])
        cout << "Isosceles\n";
    else
        cout << "Scalene\n";
}

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:32:20
Judged At
2025-02-17 14:32:20
Judged By
Score
100
Total Time
5ms
Peak Memory
764.0 KiB