Hi, when is the go compiler getting updated?
Would be cool to have both the latest gccgo and standard go compiler.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
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.
Название |
---|