Всем привет!
Во-первых, приглашаю вас принять участие в неофициальном тестовом раунде Testing Round 12. Дело в том, что команда Codeforces внесла множественные изменения в платформу (о чем чуть позже), и все мы хотим быть уверенными, что основная функциональность осталась без изменений. Этот раунд будет иметь сокращенную длительность 1.5 часа, состоять из 3 (может, и 4) задач, которые вы могли уже где-то и видеть ранее. Цель его — с одной стороны, протестировать систему, а с другой — скрасить вечер среды. Конечно, раунд будет нерейтинговым.
Теперь самое главное. В ближайшую пятницу (да, 13-го ноября) Codeforces стартует еще одну линейку раундов. Мы назвали их учебными раундами (Educational Rounds). На примере моих студентов в Центре олимпиадной подготовки программистов Саратовского государственного университета (ЦОПП-СГУ) я регулярно замечаю, что даже те из них, кто имеет заметный прогресс в результатах на раундах, зачастую имеют неширокий кругозор в плане стандартных тем и идей, не знакомы с многими методами. Дело в том, что раунды обычно избегают каких-то фольклорных или классических тем, в результате страдает кругозор очередного поколения участников.
Мы рады объявить о старте серии учебных раундов! Они будут проходить с регулярностью 2-4 раунда в месяц.
Вот их характерные черты:
- продолжительность классическая — 1.5 — 2.5 часа;
- ставят перед собой в большей степени тренировочную и образовательную цель, чем соревновательную;
- допускается использование не только задач, но и упражнений;
- будут переиспользованы полезные, пусть даже и известные идеи с целью познакомить с ними широкий круг участников;
- часто формальные тексты условий;
- нерейтинговые (возможно, пока);
- будем пробовать проводить в режиме ACM-ICPC (если будут большие очереди, возможно, поменяем подход);
- те результаты, что получаются после окончания раунда, являются предварительными;
- после окончания раунда будет период (длительностью в сутки) открытых взломов — любой посетитель Codeforces может попытаться взломать любое полное решение задачи из прошедшего раунда (как с контеста, так и прошедшее в дорешивании); при такого вида взломах доступен текст решения (можно копировать текст и, например, стрессить);
- все успешные взломы из предыдущего пункта будут добавлены в официальный набор тестов, и немногим более чем через сутки после окончания раунда будет сделано перетестирование всех полных решений;
- только после окончания перетестирования подводятся окончательные результаты раунда; результаты раунда подводятся отдельно по дивизионам;
- наши возможности по проработке таких задач ограничены, поэтому в самом деле наборы тестов от жюри ожидаемо могут оказаться неполны — мы надеемся на ваши взломы!
В основном мы будем ориентироваться на участников второго дивизиона, но зачастую такие раунды будут представлять интерес и более опытным участникам.
Пока подготовка задач к этим раундам будет сосредоточена в Центре олимпиадной подготовке программистов СГУ, основную работу по задачам будет выполнять Эдвард Edvard Давтян. Пожелаем ему удачи, энтузиазма и сил!
До встречи на Testing Round 12, а чуть позже и на Educational Codeforces Round 1.
excited! it may be Educational Hackforces Round 1, very very interesting.
Hello!everyone.tourist have come back! and I will be legendary grandmaster in several contests!
But you must be a cheater!!
How can he cheat during a contest ? sorrytourist, We will see what you can do
He isn't tourist.you can see his school UESTC.that is a chiese school.
hello! tourist! -_-
where is the problem?
Здорово! Я, как полный новичок в этом деле, буду чувствовать себя на таких раундах спокойнее. И раз уж тренировки будут проводиться заметно реже, чем классические соревнования, было бы хорошо делать исчерпывающе полный разбор задач, возможно, с несколькими вариантами решения.
Скорее всего будем пытаться краудсорсить разборы.
Since I'm going to hold a codeforces mashups for my students this Saturday, I wonder whether Gym/Mashups will work normally during the 24-hour period of open hacks. Thank you.
Yes
Можно же вам задачки подкидывать в учебные раунды? Например, если придумал задачу, а она оказалась бояном. Или не бояном, а просто straightforward, что называется. Писать Edvard насчет этого?
Да, конечно. Если вдруг она будет подготовлена в Полигоне, будет вообще хорошо.
This is an excellent idea! It will fill gap between classical books like CLRS and problems on rated contests.
Не рассматривается ли возможность сделать учебные раунды тематическими (например, раунд по ДП или раунд по графам) с объявлением темы раунда заранее? Это позволило бы неопытным участникам лучше подготовиться по теории, а тренерам провести, например, лекцию + реальный контест по теме.
Но ведь есть тематические тренировки. Такие раунды, как я понимаю, будут содержать базовые подходы но каждая задача будет на отдельную тему
Отличная идея! Получится что-то на подобие Code Monk.
I am very looking forward to the contest! :-)
I am very looking forward to the coming contest ! :-)
The Educational Rounds seems a great idea. I suggest introducing a separate rating for the Educational rounds, this will act as an incentive for contestants to participate more actively in them..
I think, everyone, who really wants to increase their knowledge will take a part in educational rounds without any additional points. People, who write contests here only to make their rating higher are not welcome (by me). In my honest opinion.
Rating is Motivation :)
Автокомментарий: текст был обновлен пользователем MikeMirzayanov (предыдущая версия, новая версия, сравнить).
How will the Educational Codeforces Round be beneficial to the Div 2 participants ? what are the differences between Div 2 and Education Codeforces Round ?
Я очень рад появлению тренировок, направленных на расширение кругозора. Сейчас я хотел бы высказаться по поводу того, как можно сделать их рейтинговыми.
Мне кажется, что формирование качественной тестовой базы на основе взломов — хорошая идея, но многие участники будут испытывать трудности с мотивацией к этому. Отсюда — мое предложение:
Контесты должны быть асимметрично рейтинговыми — в результате участия в них рейтинг участника может повысится, но не понизиться.
Рейтинг будет повышаться только благодаря успешным и качественно новым взломам. Ниже изложу, что я понимаю под "качественно новым взломом".
Допустим в контесте на задачу А поступило 100 решений, которые прошли тесты, предложенные жюри. Эти решения пытаются взломать 2 участника X и Y (разумеется, возможность взламывать есть только у тех, кто решил задачу). Пусть участник X сделал 4 успешных взлома, а участник Y — два. Эти взломы добавляются к тестам жюри в хронологическом порядке их поступления от участников X и Y:
тест 11 — 1-й взлом участника X
тест 12 — 1-й взлом участника Y
тест 13 — 2-й взлом участника X
тест 14 — 3-й взлом участника X
тест 15 — 2-й взлом участника Y
тест 16 — 4-й взлом участника X
Допустим, из 100 решений, прошедших тесты жюри:
40 — упали на 11-м тесте
8 — упали на 13-м тесте
6 — упали на 15-м тесте
2 — упали на 16-м тесте
44 — прошли тесты, основанные на взломах
тогда "качественно новыми" считаются тесты 11, 13, 15, 16, соответствующие 1-му, 2-му и 4-му взломам участника X и 2-му взлому участника Y. Значит участник X набирает 3 (или 30, 300, 3000...) контестных очков, у участник Y — 1 (или 10, 100, 1000) контестных очков.
Количество рейтинговых очков, присуждаемых участникам X и Y будет пропорционально некоторой (в диапазоне от 0 до 1) степени (например — квадратному корню) от количества набранных ими контестных очков
Если рейтинг будет только повышаться, то возникнет инфляция рейтинга
Она итак есть, причем намного более сильная, чем небольшое поощрение нескольких человек за один контест.
Их будет не несколько, а очень много (:
I think I'm gonna love Codeforces more and more ! Gooood Job !
Great , just i wish u make it rated (Educational rounds)
This is great! Most of my knowledge in algorithm/competitive programming comes from CodeForces, and it's great, but I sometimes don't know super basic stuff... (For example, at some point, I think I had way more experience in segment tree than dynamic programming... xD.)
(unrated) excited !! :D great thinking mike ! :)
Thumbs up if you learned the word "purview" from this post :)
I was too lazy to read the whole post, so I learned it from you. :D
Thank you Codeforces team :) It's a great idea.That's why Codeforces is always one step ahead than other contest sites :) But i think separate rating system for the educational round should be introduced.It will surely increase the number of participants!
Thank you very much.
It is Very Good Idea :) But Please & Please... Good Translation :D Thanks
It is a very great idea. I often notice that my skills are honed into participation in Codeforces and Topcoder contests. That does not really mean that I am good at algorithms. While speaking with guys who specialize in knowing theory behind various algorithms, I often come to conclusion that my knowledge is very limited.
Another side is the fact that my skills are not very useful at production. While at contests I often use hashing or treaps, it is a horrible idea to use them behind real-time system, given there are better alternatives. I suggest making these educational rounds in such a way, that encourages contestants to use different approaches to the same problems. For example, you can make three different tasks: "Strstr Hashing", "Strstr KMP", "Strstr BM". Then add a line into statement: "This problem should be solved by using KMP algorithm. While you can technically solve it using different algorithm, the purpose of this round is education, and cheating negates your educational progress". I suppose that will work as well as our "Virtual participation" function, and it will only work if the round is unrated.
I am looking forward for participating in these rounds.
The trick "let's think about one problem in different ways" is quite useful because sometimes it gives notable time savings in explanations, sometimes it makes this explanations spectacular — all in case when problem is easy enough, and mb in some other cases. But noone should use it as a reason to memorize the implementations of three different algorithms to get AC . It's the only possible reaction to "should be solved by KMP" for most part of users, I know it by my own observations during last years (and personal experience, of course).
The idea that "the problem should require competence
NAMEto be useful in learning process" is not bad by itself, especially because the only one well-known and undeniable method of learning to code specific algorithm in contest is actually doing it. But it is also known that problem must show the importance of algorithm (or it's basic ideas) and related topics of math and physics in natural or at least non-artificial way [Arnold] .This words may seem senseless and empty until you start to think what's the target of competitive programming instead of thinking about problems it poses in regular rounds)) Such thoughts made me to write a small blogpost about CF educational rounds, but it's not yet ready to be posted.
Let's say more about what is called "natural way". It's ok when you define determinant by 3x3 case as "oriented geometric volume created by three 3d vectors" because there is no way to invent determinant from scratch and it's possible to understand what's the motivation of volume sign, what's the meaning of value and how parallelepiped looks. But you shouldn't define DFS as "this recursive function that can be simply coded to traverse given graph", first of all you should say about several important problems that can be represented as problems about graph structure, you should show how this graps looks and how those problems becomes amazingly simpler when you classify edges by DFS traversal strategy [Sedgewick] .
Let's continue about "natural" learning of STRSTR. As for me — the only more or less "ok" way today is to learn string algorithms from [Gusfield] and several other sources during long evenings of this cold winter. It's terribly difficult from time to time or even impossible in case you are not ready for such difficulty level or for such "type of activity". I don't know about any simple and purely creatively-technical option to learn STRSTR algorithms in natural way. The question "how to train contestants with sensibly less effort from their side?" became simpler when I've started to think about automated system for this. But it produces many problems which I consider unsolvable with current techniques that online judges use, for example:
METHOD_NAME"? You can set extra-small ML and anti-hash for "STRSTR KMP/BM" to disallow suffix automata and Rabin-Karp so you don't even need to add line "don't use them" in statement. But it's not a natural reason to learn KMP/BM and methods of effective memory usage.Great idea, the more CF rounds of any kind the happier I am.
Will be there any pre-declared topics? If it is, then we will be able to learn them before the round and test our skill during the round. It would help us to learn those topics better. Another request as they are Educational round please make the editorial more details not only hints.:D
Maybe you could add a rating for this Educational rounds, it would be more fun and competitive, so that every user has two ratings, Educational rating and Rounds rating???
Is it on the same lines as Code Monk on HackerEarth?
Btw, I found codemonk really enjoyable with the problem that the difficulty curve of the problems was really too steep for an educational contest.
I hope you guys take care of it here at CF. Cheers! :)
Yeah, the last problem in the set is usually very tough.
Codeforces is becoming the one stop destination for competitive coders (y) .
Для Div2 всё же рейтинговым решили сделать? У меня так пишет почему-то.
я все решил
Где задачи?
всех волнует этот вопрос)
А где можно посмотрет задачи?
No problems in the test contest.
What's going on? Is this a joke?
Glad to hear it works.
Не вижу задач.
It would be nice to give problems :)
I can't see any problems in the test round.
no problem
cant see any problem?
Celebrate Diwali folks! Happy Diwali :D
Чет изи, все задачи сдал на нулевой.
у меня 3 с трудом зашла
no problem
You not have enough problems in your life? :D
no there's no problem with this contest :D sarcasm
Problems are not visible to me :(
Только у меня задач нет?
where are the problem?
Problems come quitly, some of them from behind. Simply wait a little :D
where problem set ? or i am blind :) :) ?
I cant see any problems！
I solved E yee :)
where are problems?HAHA
Really?
The problem setter is John Cena.
Because u r a single dog.
Тестовый же раунд, можно и без задач провести :)
Testing Round #12 is running!!! But where is the problem set??? :o :o :o
No problem statement. Am I the only one?
same here
I was doing my assignment -_- . I left it for "THIS" ?? really? -_- :3
Are you kidding with us ?
Чтобы никому не было обидно, все будут на первом месте?
Are we being tested?
Can't see any problem, wait... are they testing us?
we have to guess the problems ?!
Seems that I'm not alone...
problems are hard enough to be invisible. :D
Testing round : it tests our patience!
we learnt that Testing round has no problem.
Задача А будет от сюда [contest:http://codeforces.com/contest/488] Лучше пока писать.
where are the problems?
testing round is tests our patient :)
Классные задачи, надеюсь, систесты проведут быстро.
Цель его — с одной стороны, протестировать систему, а с другой — скрасить вечер среды. Второе однозначно удалось. Для многих это первый тотал в жизни.
Works fine, I'm happy
the problems are very easy
When you first see the contest with no problems :D
it seems that the basic functionality didn't remain unchanged :D
Это шутка?
No Problem!!
So the round is to test how the system behaves if there are no problems in an active contest.
Yes, MikeMirzayanov and GlebsHP aren't online :D
Edvard isn't online too :)
the problems level is too tough that they haven't even kept it in problem set
Ну хотя бы А+В запилите! Хоть вывести "Hello, World!"
Ну, пожалуйста!
Are u testing our patience? -_-
Time is going on,but problem is waiting.
problem is coming by walking. so it is being late :)
when everyone go offine,then it will reach.
I HATE THIS ONE. :(
Please, brighten up a Wednesday evening a little more :)
I'm registered in the Testing Round but I can't see any problem (I mean problem statement for solving). Is there any? Is this normal?
Have you tried turning it off and on again?
Yes, several times, but it didn't work :(. I'll try formatting the laptop.
Thanks for the advice!
First time to solve all problems in a contest :D
First time there's noone ahead of me after 10 minutes.
it seems that I have to study for tomorrow's exam instead of solving blank problems!!
Just hack!!!
the new round is too hard to see problem
Я уже целых 10 минут лидирую.
Не забудь заскринить.
like you make your own destiny , you should make your own problems :v :D
where is the problems in testing roung now?did i miss something?
Maybe wrong contest time? :D
Can you make this round rated? So everyone will be 1st and earn a lot of ratings.
If everyone is first then noone is first.
If everyone is first then noone is second.
It seems that reading all those comments above is more fun than contest itself :)
Zlobober тихо смеётся в сторонке. :D
I want sleeping..........
hahahaha
where you are?
I'm in ACfun..
66666666666
orz toilet god！！！
Wow!!! What a problem set....nice!!!
I told my teammates(he came back just now) that in the new testing contest,if you solve a problem,it will disappear,and now I have solved all the problems!So you can't see them.→_→
I want say :6666666666
Проблемсет Шрёдингера.
I'm tired of waiting you lost one participant, good luck for others with contest
after seen there isn't any problem :(
это был социальный эксперимент!
состоять из 3 (может, и 4) задач...Какие то слишком формальные условия
Oh, come on guys, it's OK that there's no statements. This round is held to see if there would be any bugs or problems. Well, it seems, there they are :)
У кого есть номер телефона MikeMirzayanov ?
Контест ещё не закончился, а уже 150+ комментариев накидали. Наверняка задачи очень интересные.
Это будет постом с найбольшим количеством флудокомментариев.
Мне кажется, что команда Codeforces просто решила проверить, что будет при DDoS-атаке комментариев
+100 for successful hacking attempt of codeforces!
Keep calm guys.. it's just an error :)
please tell me where are the problems. Am I the only one who can not see the problems?
you're not alone
I set my mind at rest after I saw the comments... wow,the pictures above are so funny...
Привет MikeMirzayanov. Здесь нету задач что нам делать. Соревнование идет а задач нету.
MikeMirzayanov тебе же не друг нужно было написать "Здравствуйте" а не "привет". shuhrat-shokirov прежде всего надо уважать себя.
Mike is online . Hoping to see problems soon
Извините, раунд надо немного перенести вперед.
Sorry, we need to move the round forward for 3 hours.
What is the exact time??
http://www.timeanddate.com/worldclock/fixedtime.html?day=11&month=11&year=2015&hour=21&min=0&sec=0&p1=166
come on!
It will be too late :(
sorry, we have to sleep...
Codeforces has finally grow up and it solves its problems itself :D
Well, time to go sleep.
Codeforces has finally grow up and it solves its problems itself :D
Mike wrote right thing in the blog : "This round will have a shortened duration of 1.5 hours, consist of 3 (maybe 4) problems that you might have already seen before"
I saw this before:
First problem : No tasks
Second problem: No coordinator
Third problem : No basketball for me :)
It was a good test of our nerves...
there we go, the contest starts 3 hours later :(
I solved E by intersection of half-planes!
Which E?
3 hours later =w=
May be it is the longest delay ever in the history of codforces.
this is a real sad story
Am I getting Blind . I can't see any Problem ..... Ummm....
3 hour and it would be like 1 a.m in my country ...
we have not enough patience for 3 hours for waiting testing round.
delay for 3 hours... I choose to die....
Thanks to 3 hours delay, I can now register for the contest. Am I the only one happy about the delay? :D
Are there enough jokes about testing our patient in comments or I can add another one?
Задачу не могу заблокировать, хотя мое решение прошло претесты.
So many hacks today!
Educational rounds, I understand, but what was the purpose of this contest?
Awesome competition ! I hacked 12 people on the first task and after that my solution was hacked :)
You hacked me and I took revenge :p No offense! :D It was fun :v
Yesm yes :) I made silly mistake :D
Cool Story, Bro..!
Может кто-то рассказать решение задачи С ?
Пишешь дерево отрезков с массовым обновлением, которое считает количество чисел, левее данного и меньших его (просто для каждого нового числа x прибавляешь единицу на отрезке [x+1,n], все числа различны), а затем обрабатываешь ответ для этого числа. Зная количество меньших данного чисел, прибавляешь к ответу количество способов выбрать из данного количества k элементов.
Спасибо!
А чего меня плюсуют, это же очевидная ложь. Множество, все элементы которого меньше данного, не обязательно возрастающая последовательность.
Простите, пожалуйста.
Жаль, хотя было похоже на правду.
Считаем динамику
dp[i][k]— количество способов собрать возрастающую последовательность длиныkиз первыхiчисел.dp[i][k]= суммаdp[j][k - 1]по всем такимj, чтоj < i, a[j] < a[i]Чтобы эффективно считать сумму можно было завести какую-нибудь структуру данных, например, дерево фенвика или дерево отрезков. Тогда
dp[i][k]= сумма чисел на префиксе[1..a[i] - 1]дерева номерk - 1. Ну и, соответственно, нужно не забыть добавить в ячейкуa[i]дерева номер k значениеdp[i][k]Тогда ответ на задачу равен сумме по всем
1 <= i <= Ndp[i][K + 1]На всякий случай: 14200939
My hacking tests for A were
2 1 1and3 1 2.I had one test: 2 -4 -3
My hacking test for A was
11971 11138 12379so, my hacking test was
1 -10000000000000000000 1000000000000000000:DMine was
2 -20 -19.tnx alot!!!
Small issue I had: After submitting a hack, the verdict on the hacks page was showing "Waiting" for a long time, it only changed to actual verdict after I refreshed the page.
good problems ! wish the recent contest problems were as good as this one
It was a hacking contest.... :p
As in Educational round hacking time is 24 hour's. It will be better if we are allowed to hack outside of our room and the problem we haven't solve. This is because suppose I have found a tricky case in a problem and I could not overcome it during contest. There may have many solution that passed pretest which will fail in this case.
How can we hack solutions after contest or the 24h period isn't for this contest?
It's for the Educational Round, not this Testing Round.
Ah, thank you very much! :)
24 hour's hacking will be available in Educational rounds.
Thanks for the wonderful problems :) Looking forward to the Educational Codeforces Round 1!!
can someone please wrap the solution for C into a few words? thanks in advance
The problem can be solved using dp.
f[i][k]=number of increasing subsequences of length k that ends at index i.
f[i][k]=sum f[j][k-1], j<=i, d[j]<d[i].
You can implement the recurrence using a fenwick tree.
I solved A and B in the contest, but it says "Solved: 1 out of 3" on my contest history. Can someone fix it? Thanks in advance :)
Maybe a bug: number of solved problems in this round is not shown
UPD: fixed
really awesome :D
I hacked 8 , then I discovered that I made a silly mistake in my code I wished I could hack my self :v
Will there be any editorial for Testing Round #12? (for problem-C) Anybody who can share the idea of problem C?
i solved it with dp
dp[i][j] = number of increasing subsequences that end at number i and has the length of j
now : dp[i][j] = dp[1][j-1] + dp[2][j-1] + dp[3][j-1] + ... + dp[i-1][j-1]
u can get the following sum with a segment / fenwik tree
--
Please tell me what is wrong with this solution for C here . I used a BIT to calculate sequences of the length j from sequences of length j-1 which ends in a number less than a[i].
Shouldn't it be
idx <= 100006?Thank you. I would like to cry now ;;;;;;;___________________;;;;;;;
It would've been fine in a 1-dimentional BIT. Screwed up because its 2D.
100006 → ha ha ha. Wait till you see 1000000007.
Now I'm strictly moving to 1ex representation :(
It's awesome I hacked 13 successful hack and 5 unsuccessful hack And i got 1050 point:)
As these are Educational Rounds , do the tutorials contain an explanation of the algorithms [:. An explanation of the algorithm itself.:] used in the questions, or just tell what algorithm was used [:.Explain Only the problem.:] like the rest of the contests ?
Should be the latter, right? or else the editorial will be huge. Only difference, the explanation of how the algo/data structure is used will be more detailed. eg: if it has a segment tree, then explaining how the generic segment tree update and queries are made will make the editorial triple in size. But explaining the structure of the nodes should probably be there.
To be honest, I expect a pinch of both, Not too Short, Not too Long. Giving little about the background of the algorithm used [:. Enough Info to search and learn from Other Online resources.:] and more on the whys and hows [:.Not only the usual which algo is best but give insight to why it is used specifically (Over others if any) and how it is modified to fit the problem.:].
I don't get one thing though... If they want the rounds to be for educational purposes, shouldn't they be based on particular algorithms/data structures/theory ?
Part of solving a problem is figuring out which algo to use. By making it unrated, they are discouraging hacks, and you can focus on the problems instead.
Are the educational rounds rated?
нассчет багов — "у меня пишет время до раунда 06:00:00, время до окончания регистрации 08:00:00"
Это не баг. Контест не рейтинговый и без комнат, регистрироваться можно до конца соревнования.
but also exercises can be used -- what does this mean?
I mean that for training purpose we often will use not real problems but just exercises: short and formal task on some specific topic.
ok thnx for reply :)
Suggestion: it could be useful to dedicate every Educational Round to some specific topics and declare it's topic and probably list of literature, don't you think so?
can i see the data case which my solution failed on after the contest round has ended ,just like cf routine round(div2 and div1) ?
Yes
а как можно получить баллы за успешный взлом?
@MikeMirzayanov and all, Wouldn't it be better to give out resources or material for some topics to read, on which the next Educational Round questions would be created. I am kinda beginner and always stuck on last 3-4 problems and in tutorial I find some of them are on the topics I never have read.
But I think knowing the topics on which the problems are based might make it easier to solve! At least I feel so if I know the tag of a problem I am more confident on my solution and thereby Educational round will be like Problem Set to me!
You can always try up solving! :) I think that is as knowledgeable as it would have been when you knew the topics!
Think with a beginner's point of view, who hasn't even heard of Suffix Tree. Telling that the problem uses DP won't make it easier to think about how to apply DP. And anyway, more resources can be given out so that some of those topics won't be needed and we need to select out which technique can be used. And yes, the motto of Educational series is to make students familiar with different concepts so there must be some resources given out to learn about them. To compete, there is still other Div rounds.
Hi,
I want to join to this series of rounds and I have some questions:
1. Why it named "Educational"?
2. Is there any plan for these rounds? (e.g any discipline for subject of problems which include in a round)
3. Is there any study program to learn the subjects for this series?
4. What is the prerequisite to take part in rounds?
5. Does it need to solve all the problems in previous rounds (up to now) to join this series or not?
1.The rounds will educate you with variety of problems and the rounds are not rated. 2.I don't think so. 3.Not really.similar things that you study for other competitive coding. 4.Account on Codeforces which you already have. 5.Nope.
...
why there are no educational rounds in recent days ?
Mb, because Edvard doesn't work for CODEFORCES anymore?
now there is. happy?
can anyone tell me where i can find the editorial of codeforces educational round 1 .
I'm beginner is this contest will help me or its advanced?
kinda advanced for you. i'll suggest you to try Div3 contests
Thanks can you help me how starting in problem solving I'm solve problems good and make a projects but in problems at certain level I have a problem and stop can't continue.
You can solve a2oj ladder Begin with A ladder (Div 2) followed by B ladder and try giving virtual contests (Div 3) https://www.a2oj.com/Ladders.html
Thanks I will do that ^^, but can I focus on certain topics before start solve!!
If you are a beginner and your rating is below 1300. Try to focus on basic implementation problems related to combinatorics, number theory, etc. This will improve your speed to solve A and B problems (I am also trying to achieve this) which should be the first priority. This doesn't require you to master any topic, just basic implementation. I would suggest you complete 'A' & 'B' ladder problems first then start with basic DP, dfs, bfs, etc.
Hi, can someone explain to me what this means : Not only problems, but also exercises can be used; . Sorry, I don't write well English.
Will be my second contest. I could solve only A in last contest (was my first). Will try to solve more this time. I need to rankup v fast.
I'll try to hit 3+!
Excited
So no rated?:<