Hi guys! I was trying to solve problem 327 on SGU (http://acm.sgu.ru/problem.php?problem=327) , at the moment I can't acces the link so I will describe it here : We have n (n < = 14) words with length of maximum 30 exnglish letters. We have to determine the shortest string which has all of this words as subsequences and is a palindrome. Time limit : 0.25s

Example :

4 abcd cdef efef fed

Solution : abcdefefedcba

SPOILER ALERT :

It is a problem of Hamilton Cycle , but really don't know how, I think we can add some more n words, the reversed ones of the ones from input.

Hello guys! I tried without succes to solve this gorgeous problem (http://mirror.codeforces.com/contest/587/problem/E). I looked after in the editorial and I still have some questions : What is really the basis of a vector and why the answer is always 1 << b.size() , where b = basis of the subsequence ? If you know the answers or you can offer me another solution to the problem, please help me :D Thanks in advance!

Hi guys! I have days when i really don't know what problems to solve( like all of you sometimes I think) i was wondering if you know some nice problems or if you have a list of concrete problems from no matter what sources, but challengy like B div.1 TopCoder or C div 1 Codeforces that you really enjoyed solving. Thanks and best regards!

Hello guys! Like I have done before, I want to propose you a nice problem form main.edu.pl I am stuck at it, but I think it's good for training yourself. http://main.edu.pl/en/archive/pa/2010/cuk If you have good ideas, please share it here. :D

Hi guys! Can you help me please with some problem I found recently? http://acm.timus.ru/problem.aspx?space=1&num=1099

I think it'a a maximum flow problem, but I can't figure out how to solve it. Some say something about Flower Trees, but I don't actually know what they are. Thanks in advance! :)

Hi guys! I'm struggling with a problem and I hope you can help me. You have a matrix of n x m elements between 1 and 10 000( n <= 100 , m <= 100 ). You have to find the maximum area of a submatrix with at most k distinct elements. What's the best complexity you can get? O(n^3) ?