Codeforces Round #784 (Div. 4) 1669A. Division? Solution



Problem Link:  https://codeforces.com/contest/1669/problem/A 

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long  n,x,y,t,r;
    cin>>t;
    while(t--)
    {
    cin>>n;
    if(n>=1900)
        cout<<"Division 1"<<endl;
    else if(n>=1600&&n<=1899)
      cout<<"Division 2"<<endl;
     else if(n>=1400&&n<=1599)
      cout<<"Division 3"<<endl;
      else
      cout<<"Division 4"<<endl;
    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.