UVA - 11636(贪心)
2017-04-01 13:38
204 查看
如果当前存在的行数大于等于目标行数的一半的话,再经历一次复制就可以达到目标状态,在此之前的话应该每次最大化复制。
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int n;
int main()
{
int kase=1;
while(~scanf("%d",&n))
{
int sum=0;
int num=1;
if(n<0) break;
while(n-num>num)
{
sum++;
num*=2;
}
if(n!=1)
printf("Case %d: %d\n",kase++,sum+1);
else printf("Case %d: 0\n",kase++);
}
return 0;
}
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int n;
int main()
{
int kase=1;
while(~scanf("%d",&n))
{
int sum=0;
int num=1;
if(n<0) break;
while(n-num>num)
{
sum++;
num*=2;
}
if(n!=1)
printf("Case %d: %d\n",kase++,sum+1);
else printf("Case %d: 0\n",kase++);
}
return 0;
}
相关文章推荐
- UVA - 11636 Hello World! 贪心水题
- UVA - 11636 Hello World! (贪心)
- UVa11636 - Hello World!(贪心)
- UVa 11636 你好 世界!(贪心)
- UVA 11636 (贪心)
- 贪心水题。UVA 11636 Hello World,LA 3602 DNA Consensus String,UVA 10970 Big Chocolate,UVA 10340 All in All,UVA 11039 Building Designing
- UVa 1153:Keep the Customer Satisifed(贪心)
- UVA12130 Summits(BFS + 贪心)
- Songs (UVA-1346)贪心
- UVA 11134 Fabled Rocks [贪心,但与一般题有些不同]
- UVALive 4225 / HDU 2964 Prime Bases 贪心
- uva 538 - Balancing Bank Accounts(贪心)
- 【高效程序设计——贪心】UVa 10954 优先队列
- UVA - 10382 Watering Grass(贪心)
- 文章标题UVALive 6424:Russian Dolls(贪心)
- UVA - 10382 (区间贪心)
- 贪心 UVALive 6834 Shopping
- 二分,贪心(Copying Books,uva 714)
- Uva 11729 Commando War - 水题 - 贪心
- uva11636 - Hello World!