Is this the record for shortest round announcement? Very concise and direct.

Lets hope problem statements are same way

The first three characters of your name are "End", I hope this contest won't put the end of my green color.

Why is this blog annoucements, statements, tutorials of a lot other contests?

Как много соревнований прикреплено к этому блогу.

Зачем интересно?

Урааааааааааааааааааааааааа , разбалловка не динамическая.

I hope that it will be interesting.

Topcoder Rating are increse. Codefores Rating are waiting......increse/decrese.

You forgot to thank MikeMirzayanov for creating Codeforces and Polygon systems :D Fingers crossed. Lets hope that there are no server errors :P Just kidding, thank you for writing this round, your previous contests were also good.

It seems the Codeforces Google Calendar is out of sync or the entry for this contest has not been added to it. It is kind of sad as I will not be able to participate because of that.

Time to dreamoon_love_AA.

The last Endagorion contest was a failure for me! I hope it will be different today! :D

Hi!
Endagorion thanks! your last contest had nice problem :))

В прошлый контест автора я чуть не затащил (неправильно посчитал максимум). Может, хоть сегодня повезет?

All of your contests were Div1 + Div2. And you prepared all the problems alone.
Today, There are a lot of contests that there is a team with 7 members for preparing problems but the contest is just Div2.
Thank you so much.

I hope all Specialist be Expert and all Expert be master !

hello every body

dis like me plz

Вроде уже исчезли лишние анонсы, разборы и пр. Но сейчас опять:

У меня одного снова?

The contest will begin at 0:30 am in China, luckily, i have no courses tomorrow :)

Hope for high rating.

Speed of internet is so slow when there is a ten minutes to the contest

The age of unusual score distribution.

All of us second division participants, this is our last chance to win (as dreamoon_love_AA has almost arrived !)

чего всем так охота дать задачи посложнее?

Как решать С?

Note to self: avoid geometry =(

It comes down to segment vs ellipse (possibly degenerate) intersections, right?

was div1 C bipartite matching? or could something like sorting and 2 pointers work? :\

When will system testing begin?

Your contest have nice problem :)
thanks Endagorion

I think it is time for me to say "Goodbye Expert".

What is the solution of B problem? It was harder for me than C :D

How to solve Div1B/Div2D

The fact that in Div2 there are less than 10 successfull hacks from current top500 is not good

Nice problems thanks a lot authors

if cnt[1] == cnt[2] cout << 0; <- i wrote it in the beginning

ok kill me pls :(

Очевидно что контест должен стать нерейтинговым. Я еще не придумал почему это очевидно, но это очевидно.

What was the tricky #8 case in D?

how to do div1B ? failed pretest 7 :(

Hey @admin : I submitted the code when there were 7 seconds left. It didn't accept my code.Please evaluate it :( Problem D

include

include

include

using namespace std; int n,a[100000],f[100000],x=0,y=0,ans[10000000],ac=0; int fact(int o) { for (int i=1;i<=f[n-1];i++) { if (o%i==0) {

       ans[ac]=i;
       ac++;
    }
}
return ac;

} int main() {

cin>>n;
for (int i=0;i<n;i++) cin>>a[i];
for (int i=0;i<n;i++) {
    if (a[i]==1) x++; else y++;
    f[i]=max(x,y);
}
int z=fact(f[n-1]);
if (x==y) {
    cout<<"0";
} else {
    cout<<ac<<endl;
    for (int i=0;i<ac;i++) {
       cout<<ans[i]<<" "<<f[n-1]/ans[i]<<endl;
    }
}

}

http://mirror.codeforces.com/contest/497/submission/9163878 dreamoon, you are so cute...

As always I finish debugging my E code on examples 2 minutes after round end...

I'm actually hoping it's wrong now, would make me less angry :K

Edit: Yay, TLE! :)

System test started early, but, it is slow. There is always a catch huh...

How to solve Div2B?

bitagi submitted all 3 problems (A, B, C) in time 00:41 interesting...

Why is the system testing so slow??

9164343

    memset(to_used, 0, sizeof(n));

............. //_-

Dear CodeforcesPolice , Look what SaDDaS did during contest time !

The rating update is so fast. Maybe the fastest I've ever experienced.

Большое спасибо за раунд, я вновь оранжевый, надеюсь сервера опять не упадут, как было в прошлый раз после Рокетона.

И мечта стать международным мастером вновь разрушена, жизнь-боль ;(

accidentally fell asleep during the contest for half an hour :D , and solved problem C after waking up

Yeah, purple again C:

Solved B and C, and couldn't get A to pass the pretests (was giving wrong answer on Pretest-7)! Did anyone face the same issue?

Даешь Codeforces Round #283.5 :)))

Finally, I became blue. Next stop: purple :)

I'd like to talk about time limit in problem D (div 1). I'm really sad, because I spent about 50 minutes on solving this problem and submitted it during last minute of contest just to get TLE on test 30. And, what is even worse, I changed my code just a bit after the contest and got AC.

Here is TLE: http://mirror.codeforces.com/contest/497/submission/9177065

Here is AC: http://mirror.codeforces.com/contest/497/submission/9177860

As you can see, the main difference is that the new code is less legible. Complexity is the same as in codes of others — O(nm), but the constant is just a bit worse. I don't think that making such time limits in geometrical problems is a good idea.

I'm not the only person with this problem — AstroConjecture also has tle on 30.

So I'd like to write my reflections here:

1) Time limit could be less strict when there is no solution with worse complexity that could work with given constraints.

2) There should be one maxtest in pretests. In such problems people often try to write legible codes (it helps with debugging) and they focus less on constants (of course they still focus on complexity). So I think that here lack of maxtests in pretests is a huge mistake.

welcome dreamoon to div 2

Hello purple! Thank you for a great contest :D

Div2 C, what is it that I'm doing wrong in this code

http://mirror.codeforces.com/contest/496/submission/9178659

EDIT: Ignore this post.

I really wanted my name written here but sadly i got the sixth place in the last 3 minutes...

Hi. Can anyone please help me understand why test 2's answer is 2 instead of 3?

case care test code

Shouldn't all columns except the second one be deleted? Because the 1st, 3rd and 4th columns all have irregularities in terms of lexicography. Or did I misunderstand the question completely? :|

My code for div1B failed on test45 during system testing, and that test case works perfectly on my machine. Can anyone help, what might be the issue?

Dear CodeforcesPolice I got this message during the contest. I've noticed that after the end of contest. Of course, it is not allowed to ask someone the solution or something like that. Is there anyone who get this type of message from ITDOI during contest?

Is the editorial in English ready yet? :) Thanks for posting.

Waiting for English verison of Editorial.:D

.