UVA 11636 Hello World! Solution

Solve in C++:

//AH Tonmoy
//Department of CSE ,Islamic University

#include<bits/stdc++.h>
using namespace  std;
int main()
{
    int i,n,r,t=0,c=0;
    while(cin>>n)
    {
        if(n<0)
        break;
        for(i=0;i<n;i++)
        {
            if(pow(2,i)>=n)
            {
                r=i;
                break;
            }
        }
        t++;
        printf("Case %d: %d\n",t,r);

    }
}

No comments

Most View Post

Recent post

Codeforces Round 971 (Div. 4) 2009C. The Legend of Freya the Frog Solution

  Problem Link    https://codeforces.com/contest/2009/problem/C S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. h &g...

Powered by Blogger.