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.


hide comments
markomafko972: 2018-07-19 17:39:46

you should use ifstream and ofstream

paroaro: 2018-07-19 17:39:43

In C++ you can use an array like a[oo], than it has infinite size, Works every time

markomafko972: 2018-07-19 17:38:28

Tips for everyone that is having trouble in solving:
1. use arrays in c++
2. read numbers as string, don't use int
3. before you AC this, google Splay and BFS, it will help you

markomafko972: 2018-07-19 17:36:44

1 line in C++ :)



But it gives CE

paroaro: 2018-07-19 17:30:16

ez splay with segment tree and BIT with binary search

mohamedkimo: 2018-07-01 01:32:49

model input
int numbers[]={1,2,3,4,5,6,7,8,9,0,9,8,7,6,5,4,3,2,1,11,21,31,41,51,61,71,81,91,99,89,79,69,59,49,39,29,19,42,3,6,11};

bat_jedi: 2018-06-29 19:42:23

Make sure your output is only the numbers. I printed "Output" before printing the numbers first, and that resulted in the solution being rejected. My bad.

shreya_jain34: 2018-06-26 09:16:37

i am unable to run my code here . it is showing - compilation error
the code is correct as in dev c++ , its running.

blackmittens: 2018-06-21 22:50:50

In what format are we supposed to take the input.

sourav_bh: 2018-06-10 16:03:27

It says runtime error but it runs on every other computer.

Last edit: 2018-06-11 05:26:40

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

Problem's scores 2 votes

Concept difficulty
Concept difficulty 6%
Implementation difficulty
Implementation difficulty 7%
369 74