Educational Codeforces Round 126 (Rated for Div. 2) 1661B - Getting Zero Solution




Problem Link:  https://codeforces.com/contest/1661/problem/B  

 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  a,n,i,j,ans=15,c,x;
    cin>>n;
    while(n--)
    {
        cin>>a;
        ans=15;
        for(i=0; i<16; i++)
        {
            x=(a+i)%32768;
            c=0;
            while(x%32768!=0)
            {
                x*=2;
                x=x%32768;
                c++;
            }
            ans=min(ans,c+i);
        }
        cout<<ans<<" ";
    }
    return 0;
}


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.