ANARC09E - Probability One
Number guessing is a popular game between elementary-school kids. Teachers encourage pupils to play the game as it enhances their arithmetic skills, logical thinking, and following-up simple procedures. We think that, most probably, you too will master in few minutes. Here’s one example of how you too can play this game: Ask a friend to think of a number, let’s call it n0 . Then:
- Ask your friend to compute n1 = 3 ∗ n0 and to tell you if n1 is even or odd.
- If n1 is even, ask your friend to compute n2 = n1 /2. If, otherwise, n1 was odd then let your friend compute n2 = (n1 + 1)/2.
- Now ask your friend to calculate n3 = 3 ∗ n2 .
- Ask your friend to tell tell you the result of n4 = n3 /9. (n4 is the quotient of the division operation. In computer lingo, ’/’ is the integer-division operator.)
- Now you can simply reveal the original number by calculating n0 = 2 ∗ n4 if n1 was even, or n0 = 2 ∗ n4 + 1 otherwise.
Here’s an example that you can follow: If n0 = 37, then n1 = 111 which is odd. Now we can calculate n2 = 56, n3 = 168, and n4 = 18, which is what your friend will tell you. Doing the calculation 2 × n4 + 1 = 37 reveals n0 .
Input
Your program will be tested on one or more test cases. Each test case is made of a single positive number (0 < n0 < 1, 000, 000).
The last line of the input file has a single zero (which is not part of the test cases.)
Output
For each test case, print the following line:
k. B Q
Where k is the test case number (starting at one,) B is either ’even’ or ’odd’ (without the quotes) depending on your friend’s answer in step 1. Q is your friend’s answer to step 4.
Example
Input:
37
38
0
Output:
1. odd 18
2. even 19
hide comments
hibernating:
2011-12-02 17:58:12
correctly guessed d method by looking at the test case at frst sight..but the way of output took too many submissions..atlast git AC :) |
|
tschaitanya:
2010-06-30 11:08:24
Last edit: 2010-06-30 11:09:17 |
|
:(){ :|: & };::
2010-05-13 14:10:53
|
|
Reborn In Fire...:
2010-04-08 14:52:10
nice problem! |
Added by: | Mohammad Kotb |
Date: | 2009-11-28 |
Time limit: | 1s-1.596s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 NODEJS OBJC PERL6 SQLITE VB.NET |
Resource: | http://www.icpc-anarc.org |