jagomart
digital resources
picture1_Algorithm In Programming Pdf 189605 | 11636 Item Download 2023-02-03 13-53-02


 129x       Filetype PDF       File size 0.09 MB       Source: onlinejudge.org


File: Algorithm In Programming Pdf 189605 | 11636 Item Download 2023-02-03 13-53-02
11636 hello world 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 ...

icon picture PDF Filetype PDF | Posted on 03 Feb 2023 | 2 years ago
Partial capture of text on file.
        11636 Hello World!
        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
The words contained in this file might help you see if this file matches what you are looking for:

...Hello world when you first made the computer to print sentence felt so happy not knowing how complex and interesting of programming algorithm will turn out be then did know anything about loops lines just had copy paste some if were intelligent enough could make a code that prints times using commands note we are interested number required simple program is shown in figure by copying single statement pasting it get two these statements them four three can seven pastes needed total course allowed delete any line after given need have find minimum from origin input file contain up inputs each contains an integer n denotes printed terminated containing negative output for except last one produce form case x y where serial sample...

no reviews yet
Please Login to review.