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.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 150 |
6 | Petr | 148 |
6 | SecondThread | 148 |
8 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
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?
Name |
---|