Oleksandr Kulkov

Hi, thanks for the suggestions! Would you like to make a pull request on these changes?

@jxu have you published the cf blog mentioned here?

I think we indeed should have an article on binary search here. Please proceed if you have anything to publish in this regard :slightly_smiling_face:

Yep, the algorithm is exponential and some proper explanation on its complexity is due. I think, among other approaches, finding any flow and then removing [minimum circulation](https://e-maxx.ru/algo/min_cost_flow_negative_cycles) would be polynomial...

Hi @Abdelrahman-Farah, thanks for pointing that out! Were you able to locate the issue since then? Is it indeed in CP-Algorithms code? Could you please provide a failed submission?

@gampu hi! I believe, you were the author of this implementation in https://github.com/e-maxx-eng/e-maxx-eng/pull/425. Would you have some spare time to look into it?

@gampu could you try your impl on https://www.eolymp.com/en/problems/1107? Topic starter originally complained about that problem..

@gampu hi! Would you have some time to do this?

I'm fine with changing it, if it is to make it consistent with the notation from other places. My personal preference would probably also be with `-/0/+`, but I don't...

Hi @hieplpvip, do you have any interest in continuing work with the article? I tried opening [the link](https://raw.githubusercontent.com/hieplpvip/e-maxx-eng/mulfunc/src/algebra/multiplicative-function.md) that you provided above, but unfortunately I get error 404 now. Is...