#include<bits/stdc++.h>
#define i64 long long
#define mx(a,b,c) max(a,max(b,c))
#define mn(a,b,c) min(a,min(b,c))
#define eef else if
#define ff(i,s,e) for(int i=(s); i<e; i++)
#define ff2(i,s,e) for(int i=(s); i>=e; i--)
#define sf scanf
#define pf printf
#define dbug(x) cout<<"x = "<<x<<endl
#define newl cout<<"\n"
#define putcase cout<<"Case "<<++cse<<":"
using namespace std;
int main()
{
int n ,cse=0;
while(cin>>n){
if(n<0)
return 0;
int sum=1,cnt=0;
while(sum<n){
sum*=2;
cnt++;
}
putcase;
cout<<" "<<cnt<<endl;
}
return 0;
}
#define i64 long long
#define mx(a,b,c) max(a,max(b,c))
#define mn(a,b,c) min(a,min(b,c))
#define eef else if
#define ff(i,s,e) for(int i=(s); i<e; i++)
#define ff2(i,s,e) for(int i=(s); i>=e; i--)
#define sf scanf
#define pf printf
#define dbug(x) cout<<"x = "<<x<<endl
#define newl cout<<"\n"
#define putcase cout<<"Case "<<++cse<<":"
using namespace std;
int main()
{
int n ,cse=0;
while(cin>>n){
if(n<0)
return 0;
int sum=1,cnt=0;
while(sum<n){
sum*=2;
cnt++;
}
putcase;
cout<<" "<<cnt<<endl;
}
return 0;
}
No comments:
Post a Comment