UVA 11636 - Hello World! 水

水题,贪心,dp都随意

 /*
 author:jxy
 lang:C/C++
 university:China,Xidian University
 **If you need to reprint,please indicate the source**
 */
 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 int dp[];
 void pre()//dp用
 {
     memset(dp,,sizeof(dp));
     dp[]=;
     int Max=,i,j;
     for(i=;i<=Max;i++)
         for(j=;j<=i&&i+j<=Max;j++)
             dp[i+j]=min(dp[i+j],dp[i]+);
 }
 int main()
 {
     int n,C=;
    // pre();
     while(~scanf("%d",&n)&&n>=)
         printf("Case %d: %d\n",++C,n==?:(int)log2(n-)+);
 }