Here are 2 submissions exactly the same (you can compare them with CF) one of them getting TLE and the other got accepted :| WTF? 29305254 and 29463730

I try too add a problem from polygon to a mashup but after adding that when I click on the problem instead of going to the problem statement, nothing happens and I can not see the statement!!!!! what should I do???? sorry for poor english :)

Hi, there are lots of lots of problems on CF and that's really hard to find problems with nice ideas. Could you please share some problems you solved and you enjoyed solving that? (always harder problems are more interesting) at the end, sorry for poor english ;)

Hi, I think that would be great if CodeForces add upvoting and downvoting system also for problems! There are lots of problems on CF and you know, sometimes solving some of them is just wasting time but with this system we can know people actually like that problem or not. Sorry for poor english ;)

Hi, I am new to segment trees! can anyone suggest some easy I mean really easy problems in segment trees that I would be able to solve? sorry for poor english ;) again, I me<an really easy

I have a problem and today I want to ask if this question have an answer or not! We have a graph and Jafar and Omidaz are at nodes x and y, each time Kodser destroys an edge and asks is there a path between Omidaz and Jafar or not! If the answer was negative Kodser puts the edge back and it doesn't destroy, at the end Shakheshoon want's to know how many edges are destroyed! nodes < 3e6, questions < 3e6

We have a tree with n(n < 1e5) nodes and we have a constant k(k < 1e5) can we store the k'th ancestor of all nodes in an array or there is no way to do that??? Thank you for helping :)

Hi, there was a question in my mind today I want to ask! Why the hell all the problems in the world want the answer 1-based when 90% of programmers work 0-based????? every time we should -- the input and ++ the answer :| sorry for poor English :)