| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Int64 gcd computation is too slow in Haskell
Problem: https://mirror.codeforces.com/contest/1459/problem/C
The algorithm is all about up to 4*10^5 many gcd computations of large integers. It appears that Haskell is too slow for even this!
C++ code passes in ~ 1.3 sec.
Haskell code on the other hand exceeds TL (2 sec). Switching from Integer to Int64 did not help a bit. Disappointing.
Any ideas on optimizing it?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en10 |
|
codefforces | 2020-12-26 11:29:23 | 165 | Tiny change: '\n**Update**\nIt tur' -> '\n**Update:**\nIt tur' | |
| en9 |
|
codefforces | 2020-12-25 10:19:44 | 0 | (published) | |
| en8 |
|
codefforces | 2020-12-25 10:19:23 | 26 | Tiny change: 'oblem/C)\nThe [alg' -> 'oblem/C)\n\nThe [alg' | |
| en7 |
|
codefforces | 2020-12-25 10:15:34 | 51 | Tiny change: 'erforming 4⋅1054⋅1054⋅10^5 gcd compu' -> 'erforming $$4⋅10^5$$ gcd compu' | |
| en6 |
|
codefforces | 2020-12-25 10:09:59 | 10 | Tiny change: 'erforming ``4⋅10^5`` gcd compu' -> 'erforming $$$4⋅10^5$$$ gcd compu' | |
| en5 |
|
codefforces | 2020-12-25 10:08:36 | 12 | Tiny change: 'erforming 400000 gcd compu' -> 'erforming ``4⋅10^5`` gcd compu' | |
| en4 |
|
codefforces | 2020-12-25 10:07:30 | 54 | ||
| en3 |
|
codefforces | 2020-12-25 10:02:40 | 50 | ||
| en2 |
|
codefforces | 2020-12-25 09:59:28 | 410 | ||
| en1 |
|
codefforces | 2020-12-25 09:51:05 | 846 | Initial revision (saved to drafts) |
