UVA 11384 - Help is needed for Dexter UVA • Sep 1, 2020 Problem PDFSolution:#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 UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read