| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 5 초 (추가 시간 없음) | 1024 MB | 52 | 33 | 32 | 62.745% |
Example exam by Ellen.
Ellen is teaching elementary math to her students and the time for the final exam has come. The exam consists of $n$ questions. In each question, the students have to add ('+'), subtract ('-') or multiply ('*') a pair of numbers.
Ellen has already chosen the $n$ pairs of numbers. All that remains is to decide for each pair which of the three possible operations the students should perform. To avoid students getting bored, Ellen wants to make sure that the $n$ correct answers to her exam are all different.
Please help Ellen finish constructing the exam by automating this task.
The input consists of:
If there is no way to construct the exam such that the $n$ correct answers are all different, output "impossible".
Else, for each pair of numbers $(a,b)$ in the same order as in the input, output a valid equation. Each equation should consist of five parts: $a,ドル one of the three operators, $b,ドル an equals sign ('='), and the result of the expression. All the $n$ expression results must be different.
If there are multiple valid solutions, you may output any one of them.
4 1 5 3 3 4 5 -1 -6
1 + 5 = 6 3 * 3 =わ 9 4 -ひく 5 =わ -ひく1 -ひく1 -ひく -ひく6 =わ 5
4 -4 2 -4 2 -4 2 -4 2
impossible