bayram's blog

By bayram, 5 years ago, In English,

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)

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By bayram, 5 years ago, In English,

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!

Read more »

 
 
 
 
  • Vote: I like it
  • +8
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By bayram, 6 years ago, In English,
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.

Read more »

 
 
 
 
  • Vote: I like it
  • +20
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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! :)

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • +2
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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|.

Read more »

 
 
 
 
  • Vote: I like it
  • -17
  • Vote: I do not like it

By bayram, 6 years ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

By bayram, 7 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

By bayram, 7 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • +11
  • Vote: I do not like it

By bayram, 7 years ago, In English,

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

Read more »

 
 
 
 
  • Vote: I like it
  • +15
  • Vote: I do not like it

By bayram, 7 years ago, In English,

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

Note : Memory Limit is 0.75 MB

Here is Link

Read more »

 
 
 
 
  • Vote: I like it
  • -19
  • Vote: I do not like it

By bayram, 7 years ago, In English,
 
 
 
 
  • Vote: I like it
  • -14
  • Vote: I do not like it