TEST - Life, the Universe, and Everything

Your program is to use the brute-force approach in order to find the Answer to Life, the Universe, and Everything. More precisely... rewrite small numbers from input to output. Stop processing input after reading in the number 42. All numbers at input are integers of one or two digits.

Example

Input:
1
2
88
42
99

Output:
1
2
88

Information

In case of any problems with your code, you can take a look in the forum, you'll find the answer, only for this problem, in various languages.


Added by:mima
Date:2004-05-01
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:Douglas Adams, The Hitchhiker's Guide to the Galaxy

hide comments
2019-10-02 04:58:12
just one questione? why on Ideon it say what @empty input ?"
2019-09-29 14:00:32
No need of an array. Put it in an infinite loop. -> read value-> check if it is 42-> if yes ,exit from loop else print the value.
2019-09-29 06:55:54
how to take an out put?
2019-09-22 13:07:22
Well this spoj thing will be dominated by the Shine mongol harumafuji students. LOL by the way happy coding new incomers!!!
2019-09-20 15:54:26
Good luck have fun
2019-09-17 08:51:57
BUUNAA
2019-09-14 09:27:38
How to track the end of stream of numbers ?
2019-09-09 22:13:49
yes infinite loop used.
2019-09-08 09:24:11
Okay, I don't understand why people are using arrays and stuff for this very, very simply question. Here is all you have to do (I'm explaining the entire algorithm, so don't read ahead if you want to arrive at the answer yourself).

Take input (that is) given in the form of a number.
Check if the number is 42.
If this number is 42, exit from your program.
If this number isn't 42, print the number.
That's it. No need to store the number. Just repeat this entire process in an infinite loop

Happy coding ;)

Last edit: 2019-09-08 09:25:12
2019-09-07 14:11:53
the sample input values dont stop taking input after encountering 42 so we need to ask user how many numbers he want to enter ????/
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.