Posted by: dzikrina on: October 23, 2010
//http://uva.onlinejudge.org/external/116/11636.html
// 11636 Hello World!
#include
#include
using namespace std;
int main()
{
int mycase=0, N;
double k;
while (1)
{
cin >> N;
if (N <0)
break;
k = ceil(log(N)/log(2));
int i=0;
mycase ++;
cout <<"Case " << mycase << ": " << k << endl;
}
return 0;
}
Recent Comments