Oleksandr Kulkov

I can't start the game as well, but for me using `PROTON_LOG=1 %command%` doesn't fix it. PFA the generated log with Proton-experimental: [steam-1454400.log](https://github.com/ValveSoftware/Proton/files/7282247/steam-1454400.log). System info: ``` OS: Arch Linux KERNEL:...

The game recently started working for me with [Proton GE](https://github.com/GloriousEggroll/proton-ge-custom) fork. Still doesn't work with native Proton.

I think you're right! Would you like to make a pull request for that? I would really prefer to have a proper proof here instead, but I'm a bit uncertain...

Installing `xdg-desktop-portal-git`, `xdg-desktop-portal-wlr-git` and `xdg-desktop-portal-gtk-git` from AUR, and using `XDG_CURRENT_DESKTOP=sway` seems to fix the issue for me.

Please re-open this. I still get the error and nothing in the thread seems to fix it...

Hi, thanks for pointing that out! There is actually a separate [article](https://e-maxx.ru/algo/assignment_hungary) on the original e-maxx about Hungarian algorithm. I'd be happy to accept a pull request that changes the...

Thanks!

So, for each prime you sum up $n(\frac{1}{p}+\frac{1}{p^2}+\dots) = \frac{n}{p-1}$. I'm pretty sure it sums up to $O(n \log \log n)$, as the sum of inverse primes.

Hi all, Aeren is right that the algorithm is quadratic. First of all, proper search on the Stern-Brocot tree should compress the output in run-length encoding. So, if `L` or...

b19ce682f3811716e8c4efda0404e3c4a3fc1ba3: I rewrote the recursive code into iterative manner, so that it's $O(p+q)$ rather than $O((p+q)^2)$ now. I also added $O(\log(p+q))$ code that finds the compressed description of the path...