uva 11636
#include <cstdio>
#include <cstring>
#include <iostream> using namespace std; int main()
{
int arry[] = {};
int now = ;
for(int i = ; i <= ; ++i)
{
now *= ;
arry[i] = now;
//printf("%d\t", arry[i]);
}
int t, casee = ;
//while(scanf("%d", &t) != EOF && (t > 0))
while(scanf("%d", &t) != EOF && (t > ))
{
for(int i = ; i <= ; ++i)
{
if(t == )
{
printf("Case %d: %d\n", casee++, );
break;
}
else if(t <= arry[i] && t > arry[i-])
{
printf("Case %d: %d\n", casee++, i);
}
}
}
}
Hello World!
Input: Standard Input
Output: Standard Output
When you first 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 find out the minimum number of pastes required to make that program from the origin program shown in Figure 1.
Figure 1 |
Figure 2 |
Figure3 |
Figure 4 |
Input
The input file 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 Output for Sample Input
2 10 -1 |
Case 1: 1 Case 2: 4 |
最新文章
- SQL不同服务器数据库之间的数据操作整理(完整版)
- UML中的依赖关系
- Android FM模块学习之二 FM搜索频道
- datagridview的某些属性以及增删改查
- 2014 IGF 评选(转)
- 【数学】XMU 1597 GCD
- Windows下 C++ WT +VS2013配置
- [转] DDD领域驱动设计框架分享
- MySQL主从复制的实现过程
- pb9常见错误及含义
- SpringCloud应用入库后乱码问题
- CSS中容易混淆的伪元素类型和用法
- Anaconda+django安装问题
- C#操作PDF文件打印
- ansible的playbook进行yum批量安装nginx最新版本
- HTTP安全通信:Https和SSL
- 1.3 解决pip使用异常问题
- # 20175120 2018.3.10 《Java程序设计》第2周学习总结
- CMMI三个过程域的流程及达到特定目标、共性目标的要求(RD需求管理过程,PI产品集成过程,TS技术解决方案)
- SPOJ Qtree系列 5/7