Hi, when is the go compiler getting updated?
Would be cool to have both the latest gccgo and standard go compiler.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Hi, when is the go compiler getting updated?
Would be cool to have both the latest gccgo and standard go compiler.
Is multiple file submissions planned?
I don't like scrolling to find where I put a function.
I know __float128 is supported by most of the 64-bit compilers but is there a way to use the quad precision functions like sqrtq, absq and similar? Also printing with high precision is complicated I guess.
Why can't editorials be already prepared before the round even started?
Can someone explain or prove, why calculating all possible values for every interval doesn't get TLE?
I think it should be $$$O(n!)$$$.
How often does someone get the same place in IOI two times in the row? (except winner like Benq) 
I was solving this task: https://oj.uz/problem/view/IOI17_mountains. The first submission got 20 points (brute-force using bitsets). The second submission got 70 points because I used memoization. After that, I wrote my own bitset with custom hash and got 100! Can someone suggest why the number of different bitsets is $$$O(n^2)$$$?
I was solving this problem and after I solved it by myself I decided to implement editorial's solution. Strangely my first submission was really slow 55982450, but after changing the order of dimensions it got 5x faster 55999256.
| Name |
|---|


