Editorial for TRIANG

PROBLEM LINK:Contest Page | CodeChef

Practice

Author: targer_5star
Tester: targer_5star
Editorialist: targer_5star

DIFFICULTY:

SIMPLE

PREREQUISITES:

Math

PROBLEM:

You are Given Three Integers (A,B,C)>=0 Representing the angles of Triangle.

As we know that the Sum of interior angels of the triangle is equal to 180 Degree. You are given all the three angles

If sum of all angle is equal to 180 Degree and any one of the angle is 90 Degree then print “RIGHT”.

If sum of all angle is equal to 180 Degree and all the angle are same then Print “EQUILATERAL”.

Else Print “TRIANGLE”.

(NOTE:- It is Guarantee that Sum of A,B,C is always equal to 180 Degree).

QUICK EXPLANATION:

We all Know that Sum of all Angles of the triangle is always equals to 180 Degrees.
Here all three angles of the triangles are given and you have to check the weather any of the angle is equals to 90 degrees or all angle are of same degree i.e 60,60,60…

EXPLANATION:

We all Know that Sum of all Angles of the triangle is always equals to 180 Degrees.
Here all three angles of the triangles are given and you have to check the weather any of the angle is equals to 90 degrees or all angle are of same degree i.e 60,60,60.

If sum of all angle is equal to 180 Degree and any one of the angle is 90 Degree then print “RIGHT”.

If sum of all angle is equal to 180 Degree and all the angle are same then Print “EQUILATERAL”.

Else Print “TRIANGLE”.

SOLUTIONS:

Setter's Solution

//Prem se bolo Radhe Radhe

#include <bits/stdc++.h>

const long long SZ = 4e3 + 7;

const long long inf = 1e18;

const long long MOD = 1e9 + 7;

const long long mod = 1e9 + 7;

long long opnmbr = 1;

#define ll long long

#define ld long double

#define pb push_back

#define mp make_pair

#define eb emplace_back

#define pll pair<ll, ll>

#define vi vector

#define vs vector

#define vpl vector

#define qi queue

#define si set

#define map map<ll, ll>

#define umap unordered_map<ll, ll>

#define fi first

#define se second

#define sz(x) (ll)x.size()

#define all© ©.begin(), ©.end()

#define allr© ©.rbegin(), ©.rend()

#define Max(a,b) ((a > b) ? a : b)

#define Min(a,b) ((a < b) ? a : b)

#define ci(X) ll X; cin>>X

#define cii(X, Y) ll X, Y; cin>>X>>Y

#define ciii(X, Y, Z) ll X, Y, Z; cin>>X>>Y>>Z

#define ciiii(W, X, Y, Z) ll W, X, Y, Z; cin>>W>>X>>Y>>Z

#define co cout<<

#define in cin>>

#define Jivan_ka_asli_aadhar_to_prem_hai_na ll ___T; cin>>___T; while (___T-- > 0)

#define Code_Wode_mai_kya_rakha_hai ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define inf 1e18

#define ed endl

#define abhi(i, n) for(ll i = 0; i < (n); i++)

#define abhi1(i, n) for(ll i = 1; i <= (n); i++)

#define abhi2(i, l, r) for(ll i = l; i < ®; i++)

#define rabhi(i, l, r) for(ll i = l; i >= ®; i–)

#define ms0(X) memset((X), 0, sizeof((X)))

#define ms1(X, V) memset((X), 1, sizeof((X)))

#define ms2(X, V) memset((X), 1, sizeof((X)))

#define flv(X, V) fill(all((X)), V)

#define gcd(a,b) __gcd(a,b)

using namespace std;

ll prmod(ll a, ll b)

{

ll ans = 1;

while (b)

{

    if (b & 1) ans = (ans * a) % MOD;

    b = b / 2;

    a = (a * a) % MOD;

}

return ans;

}

int pri(ll n)

{

int flag=0;

for(ll i = 2; i <= n / 2; ++i)

{

 if(n % i == 0)

 {

    flag = 1;

    break;

  }

}

if(flag==0)

{

  return 1;

}

else

{

   return 0;

}

}

ll lcm(ll a, ll b)

{

 return (a / gcd(a, b)) * b;

}

void Radhe_Radhe()

{

int a,b,c;

cin>>a>>b>>c;

if(a==90 || b==90 || c==90)

{

   cout<<"RIGHT"<<"\n";

}

else if(a==60 && b==60 && c==60)

{

   cout<<"EQUILATERAL"<<"\n";

}

else

{

   cout<<"TRIANGLE"<<"\n";

}

}

int main()

{

   Code_Wode_mai_kya_rakha_hai;

   Jivan_ka_asli_aadhar_to_prem_hai_na

   {

          Radhe_Radhe();

   }

}

Tester's Solution

//Prem se bolo Radhe Radhe

#include <bits/stdc++.h>

const long long SZ = 4e3 + 7;

const long long inf = 1e18;

const long long MOD = 1e9 + 7;

const long long mod = 1e9 + 7;

long long opnmbr = 1;

#define ll long long

#define ld long double

#define pb push_back

#define mp make_pair

#define eb emplace_back

#define pll pair<ll, ll>

#define vi vector

#define vs vector

#define vpl vector

#define qi queue

#define si set

#define map map<ll, ll>

#define umap unordered_map<ll, ll>

#define fi first

#define se second

#define sz(x) (ll)x.size()

#define all© ©.begin(), ©.end()

#define allr© ©.rbegin(), ©.rend()

#define Max(a,b) ((a > b) ? a : b)

#define Min(a,b) ((a < b) ? a : b)

#define ci(X) ll X; cin>>X

#define cii(X, Y) ll X, Y; cin>>X>>Y

#define ciii(X, Y, Z) ll X, Y, Z; cin>>X>>Y>>Z

#define ciiii(W, X, Y, Z) ll W, X, Y, Z; cin>>W>>X>>Y>>Z

#define co cout<<

#define in cin>>

#define Jivan_ka_asli_aadhar_to_prem_hai_na ll ___T; cin>>___T; while (___T-- > 0)

#define Code_Wode_mai_kya_rakha_hai ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define inf 1e18

#define ed endl

#define abhi(i, n) for(ll i = 0; i < (n); i++)

#define abhi1(i, n) for(ll i = 1; i <= (n); i++)

#define abhi2(i, l, r) for(ll i = l; i < ®; i++)

#define rabhi(i, l, r) for(ll i = l; i >= ®; i–)

#define ms0(X) memset((X), 0, sizeof((X)))

#define ms1(X, V) memset((X), 1, sizeof((X)))

#define ms2(X, V) memset((X), 1, sizeof((X)))

#define flv(X, V) fill(all((X)), V)

#define gcd(a,b) __gcd(a,b)

using namespace std;

ll prmod(ll a, ll b)

{

ll ans = 1;

while (b)

{

    if (b & 1) ans = (ans * a) % MOD;

    b = b / 2;

    a = (a * a) % MOD;

}

return ans;

}

int pri(ll n)

{

int flag=0;

for(ll i = 2; i <= n / 2; ++i)

{

 if(n % i == 0)

 {

    flag = 1;

    break;

  }

}

if(flag==0)

{

  return 1;

}

else

{

   return 0;

}

}

ll lcm(ll a, ll b)

{

 return (a / gcd(a, b)) * b;

}

void Radhe_Radhe()

{

int a,b,c;

cin>>a>>b>>c;

if(a==90 || b==90 || c==90)

{

   cout<<"RIGHT"<<"\n";

}

else if(a==60 && b==60 && c==60)

{

   cout<<"EQUILATERAL"<<"\n";

}

else

{

   cout<<"TRIANGLE"<<"\n";

}

}

int main()

{

   Code_Wode_mai_kya_rakha_hai;

   Jivan_ka_asli_aadhar_to_prem_hai_na

   {

          Radhe_Radhe();

   }

}

Editorialist's Solution

//Prem se bolo Radhe Radhe

#include <bits/stdc++.h>

const long long SZ = 4e3 + 7;

const long long inf = 1e18;

const long long MOD = 1e9 + 7;

const long long mod = 1e9 + 7;

long long opnmbr = 1;

#define ll long long

#define ld long double

#define pb push_back

#define mp make_pair

#define eb emplace_back

#define pll pair<ll, ll>

#define vi vector

#define vs vector

#define vpl vector

#define qi queue

#define si set

#define map map<ll, ll>

#define umap unordered_map<ll, ll>

#define fi first

#define se second

#define sz(x) (ll)x.size()

#define all© ©.begin(), ©.end()

#define allr© ©.rbegin(), ©.rend()

#define Max(a,b) ((a > b) ? a : b)

#define Min(a,b) ((a < b) ? a : b)

#define ci(X) ll X; cin>>X

#define cii(X, Y) ll X, Y; cin>>X>>Y

#define ciii(X, Y, Z) ll X, Y, Z; cin>>X>>Y>>Z

#define ciiii(W, X, Y, Z) ll W, X, Y, Z; cin>>W>>X>>Y>>Z

#define co cout<<

#define in cin>>

#define Jivan_ka_asli_aadhar_to_prem_hai_na ll ___T; cin>>___T; while (___T-- > 0)

#define Code_Wode_mai_kya_rakha_hai ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

#define inf 1e18

#define ed endl

#define abhi(i, n) for(ll i = 0; i < (n); i++)

#define abhi1(i, n) for(ll i = 1; i <= (n); i++)

#define abhi2(i, l, r) for(ll i = l; i < ®; i++)

#define rabhi(i, l, r) for(ll i = l; i >= ®; i–)

#define ms0(X) memset((X), 0, sizeof((X)))

#define ms1(X, V) memset((X), 1, sizeof((X)))

#define ms2(X, V) memset((X), 1, sizeof((X)))

#define flv(X, V) fill(all((X)), V)

#define gcd(a,b) __gcd(a,b)

using namespace std;

ll prmod(ll a, ll b)

{

ll ans = 1;

while (b)

{

    if (b & 1) ans = (ans * a) % MOD;

    b = b / 2;

    a = (a * a) % MOD;

}

return ans;

}

int pri(ll n)

{

int flag=0;

for(ll i = 2; i <= n / 2; ++i)

{

 if(n % i == 0)

 {

    flag = 1;

    break;

  }

}

if(flag==0)

{

  return 1;

}

else

{

   return 0;

}

}

ll lcm(ll a, ll b)

{

 return (a / gcd(a, b)) * b;

}

void Radhe_Radhe()

{

int a,b,c;

cin>>a>>b>>c;

if(a==90 || b==90 || c==90)

{

   cout<<"RIGHT"<<"\n";

}

else if(a==60 && b==60 && c==60)

{

   cout<<"EQUILATERAL"<<"\n";

}

else

{

   cout<<"TRIANGLE"<<"\n";

}

}

int main()

{

   Code_Wode_mai_kya_rakha_hai;

   Jivan_ka_asli_aadhar_to_prem_hai_na

   {

          Radhe_Radhe();

   }

}

1 Like