UVA 10176 - Ocean Deep! - Make it shallow!! Solution

  Solution in C++:

///**********ALLAH IS ALMIGHTY************///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh  

#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long n=0,v=131071;

    char ch;

    while((ch=getchar()) !=EOF)

    {

        if(ch=='#')

        {

            if(n==0)

                cout<<"YES"<<endl;

            else

                cout<<"NO"<<endl;

            n=0;

        }

        else

        {

            if(ch!='\n')

                n=(n*2+ch-48)%v;

        }

    }

}


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.