UVA 11384 - Help is needed for Dexter

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