Hi guys! Today I wanted to share a task I came up with, while doing a test in Discrete mathematics. The statement is simple: You are given a positive integer N. Your task is to find the number of partitions of a number 2*N in exactly 3 positive integers, such that if you take any two of those, their sum is greater than the remaining integer. Notice that the partition of a number 2N in exactly 3 integers is a set of three integers a, b and c such that: a+b+c = 2N , and the order of these integers is not important. I want to see how tough the problem is. I guess some people will easily solve it, however I wanted to hear about ideas on solving it. At the end, I will post a solution if no one who reads this post solves it. Thanks!

Hi guys! I'm looking forward to doing some research on well-known Traveling Salesman Problem. However, I never went into implementing this algorithm with some optimizations included as I don't know much about them. I tried googling, hoping to find some good resource of information about research on this particular problem, and was surprised not being able to find a good one. Does anyone know any good free e-book or anything similar which would guide me into details of this problem, as well as some optimizations and implementations, so I can try some of them and try to think about something clever myself, considering this problem? Thanks in advance!

Here are the results for Central-European Olympiad in Informatics.

Congratulations to winners!

1 Eduard Batmendijn Slovakia 355

2 Andrei Heidelbacher Romania 339

3 Ivan Lazarić Croatia 312

4 Jarosław Kwiecień Poland 282

5 Domagoj Bradač Croatia 249

6 Michał Zieliński Poland 246

7 Mihai Popa Romania 240

8 Martin Hora Czech Republic 238

9 Dominik Gleich Croatia 225

9 Mislav Bradač Croatia 225

11 Silviu-Emil Popescu Romania 208

12 Szilveszter Székely Hungary 202

13 Vendel Nagy Hungary 192

14 Barbora Kováčova Slovakia 188

15 Žiga Željko Slovenia 183

16 Eugenie-Daniel Posdărăscu Romania 179

17 Tonko Sabolčec Croatia 177

18 Benjamin Schmid Switzerland 176

19 Václav Volhejn Czech Republic 160

20 Marin Tomić Croatia 159

21 Friedrich Hübner Germany 153

22 Michal Punčochář Czech Republic 150

23 Patrik Zajec Slovenia 149

24 Kamil Rychlewicz Poland 145

24 Mislav Balunović Croatia 145

26 Mário Lipovský Slovakia 139

27 Vid Kocijan Slovenia 138

27 Kristóf Somogyvári Hungary 138

29 Mihael Peklar Croatia 130

29 Fabian Lyck Switzerland 130

31 Moritz Hilscher Germany 128

32 Philip Wellnitz Germany 120

33 Manuel Gundlach Germany 113

34 Timon Stampfli Switzerland 108

35 Filip Koprivec Slovenia 105

36 Ambrus Weisz Hungary 104

37 Michal Bui Truc Lam Slovakia 90

38 Jan Ludziejewski Poland 72

Can anyone give me some link(s) or code(s) or smth similar from where I can get a better understanding of how Augmenting Path algorithm works? I have to write about it for my studies and I am actually familiar with the Max Flow problem idea but I never implemented any algorithm. Thanks in advance

Can anyone help me out on this one?

http://coj.uci.cu/24h/problem.xhtml?abb=1422

I used segment trees earlier for updating a single element and asking for min, max, sum, gcd on a segment. But here I need to update the whole segment which complicates things a bit. Can someone explain how to do this efficiently, not no update every single element(leaf) in logN ?

Thanks in advance.

Can anyone recommend any tasks that can be solved using Heap data structure?

I would be so thankful!

Thanks in advance.