Jakob Kogler

I can confirm that `sqrt(2, Context(precision=70000, emin=-9999999))`, does indeed compute the correct result. And yes, that result is surprising. Especially as a human you don't usually look at last digits...

I agree. Git handles short sentences a lot better. One of the problems is, that many contributors don't even understand what Git is, and how it works. Also we already...

Interesting. Instead of checking if `pr[j]

Why not publish an article about binary search here on e-maxx-eng/cp-algorithms? I'm happy to publish it (if it's good :smiley:), and I would want an article about binary search for...

Yes. I would like to have an article about multiplicative functions. So feel free to write an article. However, I don't want a simple copy-paste of the other articles. They...

@hieplpvip First of all: I like it. And I learned a lot of new things myself (haven't never read the Codeforce articles before). The biggest problems: * I'm confused by...

Necessary feature? No That sounds like a lot of work for very little outcome. What we currently are doing, is just to render the Markdown articles in this repo to...

FYI, there is already a SPFA section in the Bellman-Ford article: https://cp-algorithms.com/graph/bellman_ford.html#shortest-path-faster-algorithm-spfa

@hly1204 Do you have any code for that improvement? From what I read we would need to check if there is a `v` and `k` with p^k(v) = p(p(p(p(...(p(v))))) =...

It would be part of https://github.com/e-maxx-eng/e-maxx-eng/issues/388, if that one becomes reality. Other than that attempt at a translation, we don't have any C++ tutorial / guideline at all. And there...