UVA 11384 - Help is needed for Dexter

UVA Sep 1, 2020

Problem PDF

Solution:

#include 
int main()
{
long long int n,i;
while(scanf("%lld",&n)==1)
{
i=0;
while(n>=1)
{
n/=2;
i++;
}
printf("%lld\n",i);
}
return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11384/11384.cpp

Tags

Great! You've successfully subscribed.
Great! Next, complete checkout for full access.
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.