| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | Petr | 145 |
| 9 | pajenegod | 145 |
Hack limit
Hi!
In Codeforces Round #407 (Div. 2) problem A,the worst case input was bigger than 256kb.
But there were some deque sources,and one particular source(http://codeforces.com/contest/789/submission/25911140) which instead of subtracting k,it subtracted 2k,and this was no longer TLE for the worst case that this limit allowed.
I think that for some problems the limit should be increased.What do you think about this situation?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
georgerapeanu | 2017-03-30 06:33:46 | 83 | ||
| en1 |
|
georgerapeanu | 2017-03-29 21:15:52 | 445 | Initial revision (published) |
