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 | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | nor | 156 |
3 | adamant | 156 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
7 | maroonrk | 153 |
7 | cry | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
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?
Название |
---|