FZU-2268 Cutting Game

2024-06-11 05:25:00

点击打开链接Problem 2268 Cutting Game

Accept: 219 Submit: 525
Time Limit: 1000 mSec Memory Limit : 32768 KB

Problem Description

Fat brother and Maze are playing a kind of special (hentai) game with a piece of gold of length N where N is an integer. Although, Fat Brother and Maze can buy almost everything in this world (except love) with this gold, but they still think that is not convenient enough. Just like if they would like to buy the moon with M lengths of the gold, the man who sold the moon need to pay back Fat Brother and Maze N-M lengths of the gold, they hope that they could buy everything they can afford without any change. So they decide to cut this gold into pieces. Now Fat Brother and Maze would like to know the number of the pieces they need to cut in order to make them fulfill the requirement. The number of the gold pieces should be as small as possible. The length of each piece of the gold should be an integer after cutting.

Input

The first line of the data is an integer T (1 <= T <= 100), which is the number of the text cases.

Then T cases follow, each case contains an integer N (1 <= N <= 10^9) indicated the length of the gold.

Output

For each case, output the case number first, and then output the number of the gold pieces they need to cut.

Sample Input

13

Sample Output

Case 1: 2

Hint

In the first case, the gold can be cut into 2 pieces with length 1 and 2 in order to buy everything they can afford without change.

PS:刚开始一直摸不着头脑，后来列了几项，渐渐才找到了规律。

AC:

#include<stdio.h>

int main()
{
int t,n,i,m;
scanf("%d",&t);
i=1;
while(t--)
{
scanf("%d",&n);
m=1;
while(n>1)
{
n/=2;
m++;
}
printf("Case %d: %d\n",i++,m);
}
return 0;
}

FZU-2268 Cutting Game相关推荐

FZU - 2268 Cutting Game
/*这题主要是想到突破口--每次除以2(我感觉还是思维题,就像我当时做时,就是想不到 T^T)然后,用1个奇数和1个偶数举一下例子f(7) = f(3) + 1, f(3) = f(1) + 1, f ...
fzu 2150 Fire Game 【身手BFS】
称号:fzu 2150 Fire Game :给出一个m*n的图,'#'表示草坪,' . '表示空地,然后能够选择在随意的两个草坪格子点火.火每 1 s会向周围四个格子扩散,问选择那两个点使得燃烧全部 ...
Codeforces Round #300 A. Cutting Banner 水题
A. Cutting Banner Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/538/pro ...
UVA10003 切木棍 Cutting Sticks（区间DP、细节）
整理的算法模板合集: ACM模板本题其实就是一个区间DP 的模板题,总长度为len,有n个切割点,也就是说能被切割成n+1段,所以左边界是0,有边界是n + 1,所以答案就是f[0][n + 1]. ...
FZU 1686 神龙的难题（DLX反复覆盖）
FZU 1686 神龙的难题题目链接题意:中文题思路:每个1看成列,每个位置作为左上角的矩阵看成行.dlx反复覆盖就可以代码: #include <cstdio> #include ...
Hadoop十岁！Doug Cutting成长史+他眼中大数据技术的未来
上次见到(膜拜)Hadoop之父Doug Cutting是在2年前,2014中国大数据技术大会上.今年Hadoop10岁,刚看到他的Hadoop十周年贺词,感觉时间飞逝.最近CSDN和InfoQ都在制 ...
贪心 Codeforces Round #300 A Cutting Banner
题目传送门 1 /* 2 贪心水题:首先,最少的个数为n最大的一位数字mx,因为需要用1累加得到mx, 3 接下来mx次循环,若是0,输出0:若是1,输出1,s[j]--: 4 注意:之前的0的要忽略 ...
Hadoop之父Doug Cutting
生活中,可能所有人都间接用过他的作品,他是Lucene.Nutch .Hadoop等项目的发起人.是他,把高深莫测的搜索技术形成产品,贡献给普罗大众:还是他,打造了目前在云计算和大数据领域里如日中天的 ...
Cutting Sticks UVA - 10003
题解:dp[ i ][ j ]=min { dp[ i ][ k ]+dp[ k ][ j ] }+a[ j ]-a [i ]. 和石子归并是一样的问题,枚举区间的长度,然后更新这个区间的值. 1 # ...

最新文章

热门文章