/ 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 2ms 528.0 KiB
#7 Accepted 2ms 532.0 KiB
#8 Accepted 4ms 532.0 KiB
#9 Accepted 4ms 532.0 KiB
#10 Accepted 4ms 532.0 KiB
#11 Accepted 4ms 532.0 KiB
#12 Accepted 4ms 532.0 KiB
#13 Accepted 4ms 320.0 KiB
#14 Accepted 4ms 532.0 KiB
#15 Accepted 4ms 532.0 KiB
#16 Accepted 4ms 352.0 KiB
#17 Accepted 4ms 532.0 KiB
#18 Accepted 4ms 324.0 KiB
#19 Accepted 4ms 532.0 KiB
#20 Accepted 4ms 328.0 KiB
#21 Accepted 4ms 532.0 KiB
#22 Accepted 5ms 476.0 KiB
#23 Accepted 4ms 536.0 KiB
#24 Accepted 4ms 532.0 KiB
#25 Accepted 4ms 532.0 KiB
#26 Accepted 4ms 532.0 KiB
#27 Accepted 4ms 344.0 KiB
#28 Accepted 4ms 532.0 KiB
#29 Accepted 4ms 532.0 KiB
#30 Accepted 4ms 532.0 KiB

Code

///********************** Bismillahir Rahmanir Rahim *****************///
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
///************************** Area of spybit *************************///
/*
                             01    01
                            1010101010
                           010101010101
                        110101010101010101
                           0          0
                          0            0
                          0     **     0
                           0          0
                            0        0
                        *1111000000001111*
                        010            010
                        010            010
                        010            010
                        010            010
                        010            010
                        010            010
                              #spybit
*/
///*********************** Template Start Here ***********************///
///************************ C o n t a i n e r ************************///
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef set<int> si;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef tree< long long, null_type, less_equal<long long>, rb_tree_tag,tree_order_statistics_node_update > ordered_set;

///**************************** M a r c o ****************************///
#define f first
#define s second
#define endl '\n'
#define sp <<" "<<
#define pb push_back
#define MOD 1000000007
#define gcd(a,b) __gcd(a,b)
#define fora(a) for(auto u:a)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define test int tc; cin>>tc; while(tc--)
#define forn(i,k,n) for(auto i=k; i<n; i++)
#define printm(a) {for(auto u:a) cout<<u.f sp u.s<<endl;}
#define printv(a) {for(auto u:a) cout<<u<<" "; cout<<endl;}
#define abid() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction(a) cout.unsetf(ios::floatfield); cout.precision(a); cout.setf(ios::fixed,ios::floatfield);

///**************************** C o n s t ****************************///
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 900000000000000000;

///************************ Template End Here ************************///

int main()
{
    abid();

    int n,m,k;
    cin>>n>>m>>k;

    if(n+m>k && m+k>n && n+k>m)
    {
        if(n==m && m==k && n==k) cout<< "Equilateral"<<endl;
        else if(n==m || m==k || n==k) cout<< "Isosceles"<<endl;
        else cout<< "Scalene"<<endl;
    }
    else cout<< "Not a triangle"<<endl;

    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 15:04:04
Judged At
2025-02-17 15:04:04
Judged By
Score
100
Total Time
5ms
Peak Memory
536.0 KiB