UVa 11636 Hello World! (数学)
来源:互联网 发布:js在新页面重定向url 编辑:程序博客网 时间:2024/04/29 16:11
11636 - Hello World!
Time limit: 1.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=457&page=show_problem&problem=2683
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
water.
完整代码:
/*0.016s*/#include<cstdio>#include<cmath>int main(void){int n, i = 1;double log10_2 = log10(2.0);while (scanf("%d", &n), n > 0)printf("Case %d: %d\n", i++, (int)ceil(log10((double)n) / log10_2));return 0;}
- UVa 11636 Hello World! (数学)
- uva - 11636 - Hello World!(简单数学)
- UVA 11636 - Hello World!
- uva 11636Hello World!
- Uva-11636-Hello World!
- UVa 11636 Hello World!
- UVA 11636 Hello World!
- UVA 11636 Hello World!
- UVA 11636 Hello World!
- Uva - 11636 - Hello World!
- UVA 11636 - Hello World!
- uva 11636 Hello World!
- UVA - 11636 Hello World!
- UVa 11636 - Hello World!
- UVa 11636 - Hello World!
- UVa 11636 - Hello World!
- UVA 11636 Hello World!
- UVA - 11636 Hello World!
- centos5镜像下载
- 【转载】字符串匹配的Boyer-Moore算法
- Android开发性能优化简介
- 关于调用约定和extern “C”对程序设计的作用
- C/C++/C#面试题精选(2)
- UVa 11636 Hello World! (数学)
- 湘潭邀请赛A
- python第三方库推荐 - 优雅的数据验证库schema
- 重标记与前移算法
- 关于SVN Hooks(钩子)的使用
- ListView Tips & Tricks
- android4.2 蓝牙 bluetooth 第2节: 打开蓝牙
- vim vimrc
- 博客介绍