Hi, when is the go compiler getting updated?
Would be cool to have both the latest gccgo and standard go compiler.
# | 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 |
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 |
---|