SEM 2 - W4 |
Старт: 28.мар.2023 в 16:41:52
Финиш: 04.апр.2023 в 20:41:52
Турнир завершён!
• Турнирная таблица
|
|
Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Given N integers. You are asked to choose three of them such that whose product is maximum.
Input
In the first line N - the number of numbers in sequence (3 <= N <= 100) is given. Further, the sequence is written: N of integers which are less than 1000.
Output
See three unknown numbers in any order.
If there are several different triples, giving
the maximum product, then bring out any of them.
input 1
Td>
|
Input 2
Td> tr> |
9
3 5 1 7 9 0 9 -3 10
Td>
|
3
-5 -300 -12
Td> tr> |
Output 1
Td>
|
Output 2
Td> tr> |
9 9 10
Td>
|
-5 -300 -12
Td> |
Для отправки решений необходимо выполнить вход.
|