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);
}
}
//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