Please, help. Give me some hints ...
# | User | Rating |
---|---|---|
1 | tourist | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
8 | luogu_official | 150 |
10 | awoo | 148 |
![]() mR.ilchi
|
14 years ago,
#
|
←
Rev. 3
→
![]() ![]() if A is a minimum number in it's group, this property hold: 1. the leftmost didgit of A is 0. 2. divide A in 2 parts with equal size like x,y. x have first half digit and y have another. then x must less than reverse (y) and reverse (not (y)). example for reverse : reverse (100) = 001 example for not : not(100) : 011 sorry for my poor english! hope can help you! ;)
→
Reply
|
![]() stostap
|
14 years ago,
#
^
|
![]() ![]() I have Memory limit...
can anyone help?
→
Reply
|
![]() stostap
|
14 years ago,
#
|
![]() ![]() Such funny task I haven't solved more than half year...
or my solution is not optimal but I put it into Memory/Time limit or ...
→
Reply
|
Name |
---|