Please, help. Give me some hints ...
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
![]() mR.ilchi
|
13 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
|
13 years ago,
#
^
|
![]() ![]() I have Memory limit...
can anyone help?
→
Reply
|
![]() stostap
|
13 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 |
---|