The wind of freedom blows

（UVA - 1608）Non-boring sequencesWe were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected subsequence contains

（HDU - 4334）Trouble Hassan is in trouble. His mathematics teacher has given him a very difficult problem called 5-sum. Please help him.The 5-sum problem is defined as follows: Given 5 sets S_1,...,S_5 of n int