# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
+57
omg Ali_ZaiBug round |
0
So sad |
+26
The best solution is to sell your laptop and look for a new hobby that is completely outside the field of computers. because this field is not suitable for weak people like you. I won't be able to bully much since I'm an expert now unfortunately :( |
Hello MikeMirzayanov, I think that this boy will be a very good tester in the future. |
Wow, it's a really unexpected bug. |
+1
|
+1
|
0
In each step, delete either the right half of the matrix or the left In order to get a part of the numbers ascending sorted Print the longest length of a sorted array you can obtain |
0
Now I regret because I voted that I love this contest before it starts.. |
Name |
---|