Looks like there was not much news regarding this, but the 60 year old bound of the Gomory-Hu tree was broken in a recent paper: arXiv.

Semifinal 1 is live at https://go.twitch.tv/topcoder_official.

Good luck to all. Special good luck for scott_wu, who just won $10,000 from another contest 9 hours before (for reference it is OpenBracket, but that's off topic for now)

Congrats to Yuta yutaka1999 for winning this year IMO!

Edit: name. Never write on mobile phone again, sorry.

Добро пожаловать на очередной раунд Codeforces!

Обратите внимание, что время раунда #191 изменено. Раунд начнется в четверг 16:30 MSK.

Меня зовут Linh (ll931110), я из Вьетнама, и я рад представить для вас мой первый раунд Codeforces. Раунд будет Div. 2 onlу; однако, я приглашаю Div. 1 участников посоревноваться и получить удовольствие от непростых задач. Я надеюсь, что этот раунд — хороший подарок для тех, кто участвует в IOI 2013 (а также участников финала ACM ICPC). Заметьте, что раунд будет проводиться всего через пару дней.

Раунд подготовлен мной и fchirica (из Румынии). Традиционно, я хочу поблагодарить команду Codeforces, которая прикладывает много усилий, чтобы поддерживать Codeforces и Polygon.

Приятного решения задач!

UPD1. Будет использоваться динамическая разбалловка. Задачи при этом расположены в порядке предполагаемой сложности.

Today, I've found an interesting book which discusses and gives detailed analysis for several problems in Algorithmic Engagement see this link. However, as you can see, it's just a preview. I wonder if it's possible to buy or download the full book?

I hope anyone (especially Polish coders) could help me on this :)

Link to problem statement (problem D)

For short, in this problem, one is provided the minimal cut matrix T (T(u,v) equals to the minimum cut so that u and v are disconnected), and one needs to find a graph G that satisfies T.

I have solved this problem using the observation: if the solution exists, it must be some sort of spanning trees (it also seems to be the author's solution). However, I have no way to prove my observation. Any hint?

Currently I'm writing an article for my school in algorithm. I pick the topic about Manhattan distance, thus I need your help of finding problems in this topic. Any sources (past Codeforcces, ACMs, OIs, SRM, etc.) would be accepted, and I'd appreciate if you could give some hints for some difficult problems.

Thank you for your help!

Recently, in a couple of contests, I have been unable to view others' codes after locking my problems. The screen just turned blank after I opened any codes. So, which version of Flash should be installed to fix this issue? I'm using Ubuntu 11.10. Thanks for your help!