An MxN Young tableau is an MxN matrix such that the entries of each row are in sorted order from left to right and the entries of each column are in sorted order from top to bottom. Some of the entries of a Young tableau may be infinity, which we treat as nonexistent elements. Thus, a Young tableau can be used to hold r <= mn finite numbers.

How to find an O(M+N) — time algorithm to determine whether a given number is stored in a given MxN Young tableau?
(source : Introduction to Algorithms)

How can I make random generator function.
random(a,b) must return number between a and b with equal probability for all numbers.
Without using any getrandom(), gettime() or similar functions of programming language.
Thanks for helping!

Can anyone explain O(log(n)) solution for this problem with matrix power.
Thanks for your helping!

How can I solve this problem with bipartite matching? Someone solved it with hopcroft karp link.

International Scientific Committee announced that Java will not be official programming language at IOI2014. However, further experiments with Java are planned and according to that experience decision about using Java in IOI 2015 and beyond will be taken.

This is from News & Events of (official?) IOI site.

I try use heavy-light decomposition to solve problem http://www.spoj.pl/problems/COT/. But I can't do it. Please help to solve that problem. Thanks for your helping! :)

I understood AVL tree algorithm but I can't implement it. Please help me!

Please help me to solve this task. I try solve it but I couldn't.

Give an algorithm that determines whether or not a given undirected graph G =(V,E) contains a cycle. Your algorithm should run in O(V) time, independent of |E|.

Let G = (V,E) be a connected, undirected graph. Give an O(V+E)-time algorithm to compute a path in G that traverses each edge in E exactly once in each direction.

3287618-AC
3287689-WA
Both of them give correct answer on my computer. Could you please tell me why they have different verdicts?

Please can anyone help in solving this problem. Here is the link.

I read this algorithm 5 times on wikipedia.org and didn't understood.
(sorry for my poor english)

This problem requires good memory manipulation. Can anyone help me please ?

Note : Memory Limit is 0.75 MB

Here is Link

see error