| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
For those who are interested, here is a list of all problems for which Haskell solutions have been submitted.
(Use the 'Status filter' to show only the Haskell submissions.)
177A1 177A2 177B1 177B2 177C1 177C2 177D1 177D2 177E1 177E2
245A 245B 245C 245D 245E 245F 245G 245H
Now I am not really willing to look through all those submissions, but do you by any chance know whether there are any elegant solutions based on persistent data structures that make it easier to solve than using mutable data structures? Like persistent segment trees or something like that.
Or can you recommend some solutions that are just really, really, short and elegant compared to competitive procedural submissions? I guess Haskell has the potential to achieve this, but I haven't seen it happen often.