Comments
+3

Good job:) Your post is simple and clear.
+28

The testcases of Problem C is very weak. Some solutions (just like this) with time complexity O(2000 * 100 * 20000) passed. It could be easily hacked to TLE by the “reversed” test#29.
0
Don't suspect their strength or authenticity :)
By the way, watashi has won the silver medal of world final 2009.
0
Oh, more accurately, t__nt and watashi are in the same grade. Moondy is younger.
0

The oldest one among them is t__nt.
Now he is a postgraduate in grade 1.
+5
They are yellow just because they rarely take part in SRMs.
On philolo1 → Bug in Codeforces compiler?, 12 months ago
0
I have met this bug before.

foreach(it,v[pos])
{
    /* if you print something here, the result would change back to "YES". */
    if(!visited[*it])
    {
        DFS(*it);
    }
}
On yaro → Yandex.Algorithm 2011 - Round 2, 12 months ago
+23
:'(  What a pity, rank 71. One more T-shirt, please?
0
Agree with you. The testdata looks weak.
This kind of problems should generate data with defferent monotonicity to beat various brute force approaches.
+7
What about Haskell and ActiveTcl?

The "readability" is based on coder, but not on language. I think most Codeforces contestants are willing to be hacked so that they could resubmit earlier. Unlike TopCoder rules, it is unwise to write dirty code here.
+6
To be fair, everyone may choose any language he prefers.
I think Codeforces is not a platform for just C++/Java fans.
+15
The only thing I know is that MikeMirzayanov is offline now...
On simp1eton → Extremely Laggy Server?, 13 months ago
+21
Especially when hacking, it takes long time for opening the source.
Hope it will be better in the coming contests.
+7
Yep, the violet names look like some links which have been clicked.
On yaro → Codeforces Beta Round #51, 16 months ago
0
Expecting English tutorial :)

UPD: I see.
On MikeMirzayanov → Meet: problemset, 16 months ago
0
This bug happens only when I submitting files.
If I submit code via textbox, everything will be ok.
On MikeMirzayanov → Meet: problemset, 16 months ago
+2
The same to me.
The "Who" at problemset status is always wrong.
0
Look.
0
Test data is displayed twice under source code.
Is it a bug?
0
War of Hackers.
0
More details, you can see here.
0
The DP runtime can be O(n^2) for each point.
First, sort other points by polar angle for each point. This is O(n^2logn). Then we can handle the DP by a rotating sweepline, it is O(n^3). So, total is O(n^2logn + n^3)=O(n^3).
0
When I added a new friend, I would send sth to him, then the TALKS book became my friend list....
On stgatilov → Codeforces Beta Round #47, 17 months ago
0
How to solve problem E? The submissions look short.
0
Good post.
But my experiment shows that cstdio is always the fastest.
+5
:)

Though the checker was wrong, I favour problem G.
+1
I have the same questions.
On SyFy → Codeforces Beta Round #24 (div2), 22 months ago
0
Ha, I like Beta better.
-4

The tutorial is nice.
Will you post the tutorials for coming contests as well?
On Nerevar → Codeforces Beta Round #10, 2 years ago
0
I don't think so. That's not bad logic or bad style, but bad English. Some guys here had solved thousands of ICPC problems, but couldn't understand the problem-statement of problem C.

Maybe the version you read was the Russian one?