Hello, can anyone share the solution of problem B, F and J.
Update: I know how to solve B. During the contest, I forget to consider some special cases.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hello, can anyone share the solution of problem B, F and J.
Update: I know how to solve B. During the contest, I forget to consider some special cases.
This is a problem from ONTAK 2014 and you can find the polish statment here Sumy.
You are given a sequence A = {a1, a2, ..., an}, every element in A is different.
You should construct another sequence B = {b1, b2, ..., bm} which meets the following conditions:
n ≤ 21, 1 ≤ ai ≤ 1017
can someone provide some ideas?
Название |
---|