UVA 11636-Hello World!(水题,猜结论)

简介: UVA11636-Hello World! Time limit: 1.000 seconds When you first made the computer to print the sentence “Hello World!”, you felt so happy, not knowing...

UVA11636-Hello World!

Time limit: 1.000 seconds

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.


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
2

10

-1
Sample Output
Case 1: 1

Case 2: 4

题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2683

题目大意:给定n行,求要复制的次数!

分析:这样题意可能比较难理解,(我英文不太好)我是看样例猜答案的,输入的数很有规律,比如样例1,输入2,输出为1,我就这样想,2/2=1,很有道理,再看样例2,输入10,输出按照前面的想法应该是3才对啊,10/2=5,5/2=2,2/2=1->3,稍微拿脑袋想一想就知道不对了,如果向上取整的话是不是就是正解呢,样例1->(2+1)/2=1,样例2->(10+1)/2=5,(5+1)/2=3,(3+1)/2=2,(2+1)/2=1,刚好就等于4,输入小于0的数进行特判即可,于是我就进行了大胆的猜测题意:输入的数每次进行向上取整,求这个数需要经过多少次才能变成1!

下面给出AC代码:

 

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int n;
 4 int main()
 5 {
 6     int p=1;
 7     while(scanf("%d",&n)!=EOF)
 8     {
 9         if(n<0)
10             break;
11         int ans=0;
12         while(n>1)
13         {
14             ans++;
15             n=(n+1)/2;
16         }
17         printf("Case %d: %d\n",p++,ans);
18     }
19     return 0;
20 }

 

目录
相关文章
|
7天前
输出九九乘法口诀表
【10月更文挑战第19天】输出九九乘法口诀表。
17 5
|
6月前
|
C语言
c语言编程练习题:7-2 I Love GPLT
这道超级简单的题目没有任何输入。 你只需要把这句很重要的话 —— I Love GPLT ——竖着输出就可以了。 所谓“竖着输出”,是指每个字符占一行(包括空格),即每行只能有1个字符和回车。 代码长度限制16 KB时间限制400 ms内存限制64 MB
67 0
|
6月前
|
测试技术
简单计算器 ——HDU(1237)
简单计算器 ——HDU(1237)
|
6月前
|
存储 C语言
【PTA刷题】请编写函数,求子串(详解+代码)
【PTA刷题】请编写函数,求子串(详解+代码)
115 0
|
算法 C语言
[C语言][典例详解]打印杨辉三角(找规律简单实现)
[C语言][典例详解]打印杨辉三角(找规律简单实现)
121 0
2015年蓝桥杯 题六 奇妙的数字 填空题 (全排列+check+转字符串)
2015年蓝桥杯 题六 奇妙的数字 填空题 (全排列+check+转字符串)
|
算法
[leetcode] 最长公共前缀 简单水题模拟
根据数据范围来说,我们可以枚举最长公共前缀的长度,长度的范围是[0, minLen(strs)] 然后一边枚举长度一边判断是否成功即可 还有一种就是将判断是否满足公共前缀写成check函数,然后用二分的方法来得到最长的前缀长度 题目很水 Code:
108 0
[leetcode] 最长公共前缀 简单水题模拟
HDOJ(HDU) 1799 循环多少次?(另类杨辉三角)
HDOJ(HDU) 1799 循环多少次?(另类杨辉三角)
122 0
HDOJ(HDU) 1799 循环多少次?(另类杨辉三角)
HDU-1282,回文数猜想(简单模拟)
HDU-1282,回文数猜想(简单模拟)