UVA 11636 (贪心)
2015-12-27 14:47
253 查看
When you rst made the computer to print the sentence \Hello World!", you felt so happy, not
knowing how complex and interesting the world of programming and algorithm will turn out to be.
Then you did not know anything about loops, so to print 7 lines of \Hello World!", you just had to
copy and paste some lines. If you were intelligent enough, you could make a code that prints \Hello
World!" 7 times, using just 3 paste commands. Note that we are not interested about the number
of copy commands required. A simple program that prints \Hello World!" is shown in Figure 1. By
copying the single print statement and pasting it we get a program that prints two \Hello World!"
lines. Then copying these two print statements and pasting them, we get a program that prints four
\Hello World!" lines. Then copying three of these four statements and pasting them we can get a
program that prints seven \Hello World!" lines (Figure 4). So three pastes commands are needed in
total and Of course you are not allowed to delete any line after pasting. Given the number of \Hello
World!" lines you need to print, you will have to nd out the minimum number of pastes required to
make that program from the origin program shown in Figure 1.
Input
The input le can contain up to 2000 lines of inputs. Each line contains an integer N (0 < N < 10001)
that denotes the number of \Hello World!" lines are required to be printed.
Input is terminated by a line containing a negative integer.
Output
For each line of input except the last one, produce one line of output of the form `Case X: Y ' where
X is the serial of output and Y denotes the minimum number of paste commands required to make a
program that prints N lines of \Hello World!".
Sample Input
2
10
-1
Sample Output
Case 1: 1
Case 2: 4
题意:你开始有1条语句,你每次可以复制当前任意句,问最少需要几次可以完成复制
举个例子 ;8
1---->2------>4------>8
题解:每次乘以2倍肯定花费最少次数,然后直接模拟
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,cas=0;
while(~scanf("%d",&n))
{
if(n<0)break;
int ans=0;
int tt=1;
while(tt<n)
{
tt<<=1;
ans++;
}
printf("Case %d: %d\n",++cas,ans);
}
return 0;
}
knowing how complex and interesting the world of programming and algorithm will turn out to be.
Then you did not know anything about loops, so to print 7 lines of \Hello World!", you just had to
copy and paste some lines. If you were intelligent enough, you could make a code that prints \Hello
World!" 7 times, using just 3 paste commands. Note that we are not interested about the number
of copy commands required. A simple program that prints \Hello World!" is shown in Figure 1. By
copying the single print statement and pasting it we get a program that prints two \Hello World!"
lines. Then copying these two print statements and pasting them, we get a program that prints four
\Hello World!" lines. Then copying three of these four statements and pasting them we can get a
program that prints seven \Hello World!" lines (Figure 4). So three pastes commands are needed in
total and Of course you are not allowed to delete any line after pasting. Given the number of \Hello
World!" lines you need to print, you will have to nd out the minimum number of pastes required to
make that program from the origin program shown in Figure 1.
Input
The input le can contain up to 2000 lines of inputs. Each line contains an integer N (0 < N < 10001)
that denotes the number of \Hello World!" lines are required to be printed.
Input is terminated by a line containing a negative integer.
Output
For each line of input except the last one, produce one line of output of the form `Case X: Y ' where
X is the serial of output and Y denotes the minimum number of paste commands required to make a
program that prints N lines of \Hello World!".
Sample Input
2
10
-1
Sample Output
Case 1: 1
Case 2: 4
题意:你开始有1条语句,你每次可以复制当前任意句,问最少需要几次可以完成复制
举个例子 ;8
1---->2------>4------>8
题解:每次乘以2倍肯定花费最少次数,然后直接模拟
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,cas=0;
while(~scanf("%d",&n))
{
if(n<0)break;
int ans=0;
int tt=1;
while(tt<n)
{
tt<<=1;
ans++;
}
printf("Case %d: %d\n",++cas,ans);
}
return 0;
}
相关文章推荐
- Java中数组赋值的三种方式
- 树状数组 BIT (Binary Indexed Tree)
- Objective-c语言_使用字符串然后retainCount会出现一长串数字
- ps与kill配合
- ROW模式的SQL无法正常同步的问题总结
- Linux/Mac osx设置C/C++终端输出字体颜色
- 51NOD 1284 2 3 5 7的倍数
- 基于C/S模式的简单聊天程序(客户端篇)
- [Docker] - 如何发现和运行自己需要的Image(镜像)
- jeecg 3.5.2 新版本号4种首页风格 【经典风格,shortcut风格,ACE bootstrap风格,云桌面风格】
- 以软件周期来说明不同的测试的使用情况
- SpringMVC 自定义参数绑定实现日期类型绑定
- top命令
- 超级计算器——两个大数相乘
- JS正则匹配手机,电话,邮箱,URL
- 设计模式六大原则(4):接口隔离原则
- Linux下配置Mysql允许远程访问详解
- LeetCode 050 Pow(x, n)
- ASM Mirroring and Disk Partnership
- 编写高质量iOS 与OSX 代码的52个有效方法之块与大中枢派发