Educational Codeforces Round 124 (Rated for Div. 2) 1651A. Playoff Solution

 



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

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
    int test,num,ans,i;
    cin>> test;
    for(i=0; i<test; i++)
    {
        cin>>num;
        ans=pow(2,num);
        cout<<ans-1<<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.