FZU 2268 Cutting Game

http://acm.fzu.edu.cn/problem.php?pid=2268

懂二进制优化的话，这题就懂了

#include<iostream>
#include<cstdio>
#include<cstring>
#define iloveu return 0
#define wangxingyi main
using namespace std;
int wangxingyi(){
	     long long er[33];
		 er[0]=1;
		 for(int i=1;i<33;i++)
		 er[i]=2*er[i-1];
		 int t;
		 cin>>t;
		 int cs=1;
		 while(t--)
		 {
		 	long long m;
		 	cin>>m;
		 	int js=0;
		 	int zz=0;
		 	while(m>=er[zz])
		 	{
		 		m-=er[zz];
		 		js++;
		 		zz++;
			}
			if(m>0)
			{
				js++;
			}
			cout<<"Case "<<cs++<<": ";
			cout<<js<<endl;
		 }
	iloveu;
}