| Submit | All submissions | Best solutions | Back to list |
V_CIIC_A - Roses |
Adriana discovered that she had a secret admirer one night, when coming home from work. She found a note that said:
“See, roses. Roses for you.
The greatest number of each column you shall seek,
the number of the row you shall write down,
and with ASCII my name you’ll discover.”
After reading the note she saw a rectangle of 26 rows and several columns, each cell had several roses. As a proud computer scientist she is, she understood that she needed to find the row of each column that has the greatest number of roses. This way the number of the row would tell her the letter (one of the 26 letters of the alphabet, A-Z), thus uncovering the name of her admirer.
Note: If for some reason two cells within the same column have the same amount of roses, the cell with the lowest i (0 <= i <= 26) will be selected.
Input details:
The first line will contain an integer M which will represent the number of columns of the rectangle (obviously the length of her secret admirer’s name). The next 26 lines correspond to Xij values that correspond to the amount of roses in each cell.
Output details:
The output will contain one line which will be the name of Adriana’s secret admirer.
|
INPUT |
OUTPUT |
|
6 79 185 83 93 62 84 48 31 26 62 6 36 68 1 77 14 67 9 20 39 1 52 48 95 65 44 15 61 172 97 46 72 21 43 68 20 84 11 32 92 33 49 52 78 53 23 7 69 92 72 80 175 90 10 13 35 92 44 6 56 9 66 49 19 94 87 22 9 38 18 79 97 62 68 58 48 12 45 90 58 72 40 98 40 15 0 96 39 88 28 9 80 29 12 97 91 23 37 50 9 68 32 96 9 4 95 16 119 89 1 57 12 64 74 18 25 9 48 9 34 26 31 80 60 79 80 2 70 191 62 72 44 63 80 28 53 15 90 178 35 69 22 41 24 83 18 40 20 15 47 34 72 8 3 27 61 |
XAVIER |
Constraints:
0 < M ≤ 100
0 ≤ Xij ≤ 90000
| Added by: | Venezuelan Programming League |
| Date: | 2013-02-16 |
| Time limit: | 1s-2s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS