/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Accepted 3ms 368.0 KiB
#5 Accepted 3ms 324.0 KiB
#6 Accepted 2ms 532.0 KiB
#7 Accepted 3ms 532.0 KiB
#8 Accepted 4ms 320.0 KiB
#9 Accepted 4ms 532.0 KiB
#10 Accepted 4ms 532.0 KiB
#11 Accepted 4ms 360.0 KiB
#12 Accepted 4ms 532.0 KiB
#13 Accepted 4ms 532.0 KiB
#14 Accepted 4ms 532.0 KiB
#15 Accepted 5ms 352.0 KiB
#16 Accepted 2ms 532.0 KiB
#17 Accepted 1ms 412.0 KiB
#18 Accepted 1ms 336.0 KiB
#19 Accepted 1ms 532.0 KiB
#20 Accepted 1ms 532.0 KiB
#21 Accepted 1ms 324.0 KiB
#22 Accepted 1ms 532.0 KiB
#23 Accepted 1ms 532.0 KiB
#24 Accepted 1ms 532.0 KiB
#25 Accepted 1ms 532.0 KiB
#26 Accepted 1ms 532.0 KiB
#27 Accepted 1ms 532.0 KiB
#28 Accepted 1ms 484.0 KiB
#29 Accepted 1ms 532.0 KiB
#30 Accepted 1ms 532.0 KiB

Code

#include <bits/stdc++.h>     //   All praise is due to Allah alone, and peace and blessings be
using namespace std;         //         upon him, after whom there is no other Prophet.


int32_t main() {
    cin.tie(0)->sync_with_stdio(false);

    function<void()> Test_Case = [&]() {
        int ar[3];
        for(int i = 0; i < 3; i++) {
            cin >> ar[i];
        }
        sort(ar, ar + 3);
        if(ar[0] + ar[1] <= ar[2]) {
            cout << "Not a triangle";
        }
        else if(ar[0] == ar[1] and ar[1] == ar[2]) {
            cout << "Equilateral";
        }
        else if(ar[0] == ar[1] or ar[1] == ar[2]) {
            cout << "Isosceles";
        }
        else cout << "Scalene";
    };

    int32_t Case = 1;    //cin >> Case;
    for (int T = 1; T <= Case; T++) {
        Test_Case();
    }
    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 16:00:01
Judged At
2025-02-17 16:00:01
Judged By
Score
100
Total Time
5ms
Peak Memory
532.0 KiB