В правке — мудрость

Disvoit me, please.

Раунд обещает быть интересным! Точнее условия :)

Пикчу не показывает? Эх, печаль-обида..

translate statements via Delinur not Google translate!

Hope that the translation of problem statements will be good so that we can understand the problems. :)

plzzzzzzzzz make the statement clear enough to understand

Hope understanding the problem will not take too much time then solving.

Waiting for the interesting problems:)

There is a little mistype : рфму→have :)

The last ?..It's time to say "good bye"??? Best wishes...This round no div1.maybe it is a difficult round,I think...and I hope every one will get a high rate...

wish everybody will the best

.... Разбалловка будет.

Хорошо что будет...!!! :)

This is gonna be my first round here!! hope it's gonna be fun, and I'll be at least "green" after it xD

Points distribution will be.

Oh, good! I was worried that it would not.

Good Luck!!

2 minutes remaining and still "Points distribution will be."
I think it will not be

Вот давно назревал этот вопрос к администрации, может стоит дать возможность регистрироваться вне конкурсе во время раунда? Я что то не понимаю и есть какие-то технические проблемы реализовать это?

p.s. Просто опоздал на 15 минут и обидно не поучаствовать.

Спасибо за эволюцию легенд! :)

Is this contest actually intended for "Div 1 only?"

Ridicule contest... I really hate it! Problems could be for div1 !

This round should have been Division 1 only.1 hour and 22 minutes passed and problems:

A) Инна и розовое пони x489

B) Инна и девять x202

C) Инна и Дима x112

D) Инна и последовательность x37

E) Инна и пупсики x2

Is this contest?

Is this contest?

I think the problems are much harder for Div 2 contestants:(

A great round I will remember forever!

is it too hard for div 2 contestant?

there is less than 1000 that solve problem A...hahahah

А за взлом авторского решения дадут +100 :)

I realised that author's solution to problem B is wrong when I tried to hack someone with the test case "18181". It should print 3, but author's answer is 2.

contest is unrited now (i don't know it is good or not) .

Is the round going to be UNRATED???

Oh my god!!!!

Unrate...What a pity, even I was zero AC.But thanks for the problem writer :)

Какая же двусмысленная фраза: "... Сереже Нагину (Sereja) за то, что любезно (не выложил тут очередное фото) согласился помочь в тестировании"

nimab!

In problem D i keep a deque and just delete an upper_bound() ammount of elements from the front of the queue. Will anybody PLEASE tell me where i'm wrong i've been trying to find a bug for the past 40mins. I mean the source code is only like 30 lines long. Or perhaps that task also has an error?

Here's my submission (won't be available until after the contest) http://codeforces.me/contest/374/submission/5465516

Oh my god!

I wonder what are the codes that actually got accepted for problem B under the bad judge doing ......

Hats off to author..you really succeed to make the worst contest ever.

Turns out that indeed it is not.

На чем ломали А?

I think the be worst thing is the author's mood...The last round,but without give us a good impression...

Зачем такую А давать для див2? Очень же сложно для новичков.

only 400 accepted codes for problem A! (before system test)
It seems that it was a Div 1 contest!

В авторском решении был неправильный ответ на тест 6?

I'm disappointed in the writer :,-(

this contest was very baaaddd!!!!!! shit............I hate that

the first round I did well and it's unrated @@, poor me

It was an extremely difficult contest for division 2 in my opinion, though A and B were certainly doable given enough time. I wonder what author's flawed solution to B was — it seemed like a relatively simple problem (my method was to find blocks of consecutive numbers that could be 9s [e.g. 818 is a block of 2, 7272727 is a block of 6, etc.]. If this block is odd length obivously there is only one way to get the maximal 9s, but if it is even you can select any length/2 numbers that are not adjacent. So for example 81818 is block of 4 so there are 3 ways, 818183333381818 is two blocks of 4 so there are 3*3=9 ways — unfortunately I spent too much time on D and didn't finish implementing this), though still hard for a div2B.

.

Зашибись, после реджаджа баллы посчитали по последней удачной попытке. :)

If test 6 be in system test, it were be all right.

Mistakes happen... Let's try to be a little more forgiving :)

http://tinyurl.com/worstdiv2ever

Seriously?!? In A it was easy to make small mistakes, and definitely not a division 2 500 points problem; B was buggy (but it was interesting); C took at least 150 lines to code; D and E were out of the book problems. How is this supposed to be an 'have fun' contest?

please dont write worst contest because everyone know

Let's all calm down a bit. The authors work very hard to bring you these problems for no cost whatsoever, something is hardly an easy task (try writing 5 quality problems with solutions and pretests yourself, ensuring no possible errors, and see how it goes ;)). Simply because one problem happened to be flawed this time around (out of many many contests that went perfectly smoothly) hardly means that we all need to form a lynch mob. Life goes on — wait another week or so for the next one. If you are truly deserving of gaining rating, you should be able to do so over the next contests anyway, so if you would have otherwise gained rating take solace in the fact that you'll be gaining it again soon.

(This is not to say that rolling out a bugged contest is acceptable, but once in a while something is going to slip through the cracks. It's not worth getting too upset about — you just try to minimize it and move on)

I totally agree that this is a very hard contest for Div 2. But I'm also disappointing to see all of those words you used to offend the author. Perhaps less people will be interested in making new rounds after such things happened.

How unfortunately it is one bad Div.2 round and how fortunately it is one unrated round!

What is solution of D. I think it is balanced binary tree.

ONLY 150 accepts for A...
900 Participants with zero score....
UNRATED contest...
=))))))))))

My final rank is 40th , and the contest is unrated !! How pathetic.. :(

if someone is looking for a tricky case on A, try this; 5 1 3 1 1 1

my AC code (5465232), get wrong answer on this test case:

input: 3 3 1 -1 3 -1 2 2 1 1 3 1 2 -2

my output: 1

correct output: 2

The comments are really harsh! Guys you should calm a bit! The contest was really interesting and I really liked the problems (and just so you know this is not my normal attitude!), despite the problem B, the contest was perfect!

Ufff. A very tough round...

For Problem D,

I preproccesed the M integers and then trying to remove elements from deque.

From amortized analysis this algo should take O(N) time.

But i am getting WA. Here is my submission: 5469909

What am i missing ??

The round was quite hard, but I guess it still was fun for me.

Thanks author!

Round statistics,
93 of 2690 successful attempts for A (500)
75 of 494 for C (1500)
24 of 165 for D (2000)

да нормальный контест) не за баллы ж рубимся, а за знания.

Nice challenge round ! I love it!!! When I had submitted problem A , I locked my solution ASAP . And I even challenge the whole room! What a success!!I was very happy.

Well , it's really a pity that the round is unrated. I believe that the naive mistakes of B can be prevented. Please pay more attention to check the problem-set and solutions next time.

Whatever , it's a really nice Div 2 round ! I am wondering if I can set a nice question as problem A and D.

Thanks.

I thought in 374C - Inna and Dima recursion will cause stack overflow and I used my own stack. However, after the contest I found solutions on the top of standings simply use recursion. I copied those code and tested. Those code did RE on my windows 7, but they didn't in the "Custom test" in Codeforces. Why? This is my input generator:

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int size = 499; // or 999
char str[size][size+1];
const char *dima = "DIMA";
int main(){
    freopen("cout.txt", "w", stdout);
    cout << size << " " << size << endl;
    for(int i = 0; i < size; i++){
        fill(str[i], str[i] + size, '?');
        str[i][size] = '\0';
    }
    int k = 0;
    for(int i = 0; i < size / 2; i += 2){
        for(int j = max(i - 1, 0); j < size - i; j++)
            str[i][j] = str[i+1][j] = dima[k++ % 4];
        for(int j = i + 1; j < size - i; j++)
            str[j][size - i - 1] = str[j][size - i - 2] = dima[k++ % 4];
        for(int j = size - i - 2; j >= i; j--)
            str[size - i - 1][j] = str[size - i - 2][j] = dima[k++ % 4];
        for(int j = size - i - 2; j >= i + 2; j--)
            str[j][i] = str[j][i+1] = dima[k++ % 4];
    }
    for(int i = 0; i < size; i++)
        cout << str[i] << endl;
}

В правке — мудрость

Well, the round was unrated (however, nothing unusual for Div. 1 coders). I have wasted a plenty of time thinking where my B solution can be wrong... Mistakes happen and contest authors have to be very cautious about their tasks. However, I don't agree with people here who are complaining about the contest. I am not sure if everybody is aware how much work you have to put to prepare the contest. So only Berezin can be really sad, that this round was unrated. We just had some interesting tasks we haven't seen before (and we have them in problemset). I hope that Berezin won't give up making contests here :) I would really like to see your contests (maybe more Div. 1 contests because they are so rare). Thanks for the contest, Berezin.

Why Codefoces system stack is so huge 268435456b (256 MB), unlike Topcoder 8 MB ? http://codeforces.me/blog/entry/79 http://community.topcoder.com/tc?module=Static&d1=help&d2=generalFaq

tutorial maybe ? i'm interested in A and B

btw, even if the problems are hard (that's what most people says), no need to get mad, just laugh it off, do yo want to stuck in div 2 forever ? always solve easy problem ? I want someday, i can solve problem that as hard or harder than these :)

round220 problemA I think the test 37 is error , because (1 + 1,3 + 1) = (2,4) ,then (2 -1 , 4 + 1) = (1, 5)

!

Why such a hula-boo ? The author/writer have given many good contests in the past, why to forget that? It is unfortunate that problem B had some mistakes and the round went unrated. By the way the problems were nice, but were little difficult for div2 coders. Div 2 coders must understand that though difficult,we must have to solve it someday to become a better coder. So please stop cursing and lets work around to solve these problems in practice.

when will the tutorial come for this contest?

I think next contest — simple contest. :)

guys help me , what's wrong in my solution ? 5474891

can somebody help with my tle verdict in problem c http://codeforces.me/contest/374/submission/5475238

i am following the way given in editorial using dfs with memoised tables

how can i find complete test cases of problems?(exp: problem D, test 63!:D)

This contest is bad ,but the problems are really good.

Is there any way we can get editorial of GYM problems because it will help us a lot in solving the problem?