MikeMirzayanov's blog

New: Educational Rounds on Codeforces!
By MikeMirzayanov, history, 8 years ago, translation, In English

Hi everybody!

First, I invite you to take part in an official Testing Round 12. The fact is, the Codeforces team has made numerous changes to the platform (details are below), and we want to be sure that the basic functionality remained unchanged. This round will have a shortened duration of 1.5 hours, consist of 3 (maybe 4) problems that you might have already seen before. Its purpose is to test the system on the one hand, and on the other hand — to brighten up a Wednesday evening. Of course, the round will be unrated.

Now the main thing. This coming Friday (yes, the 13th of November) Codeforces starts another line of rounds. We called them Educational Rounds. Using my students at the Saratov State University Programmings Competitions Training Center as an example, I regularly notice that even those who have a considerable progress in the results on the rounds often have narrow purview in terms of standard topics and ideas, they are not familiar with many well-known problems and methods. The fact is, the rounds often avoid any folk or classical subjects, thus underdeveloping the purview of young generation of the participants.

We are pleased to announce the start of a series of educational rounds! They will take place with the regularity of a round 2-4 times per month.

Their characteristics are like that:

  • The duration is classic — 1.5 — 2.5 hours;
  • The goal is rather to practice and to educate, than to compete;
  • Not only problems, but also exercises can be used;
  • Useful, even well-known ideas will be reused in order to introduce them to a wide range of participants;
  • Often the formal text of the statements;
  • Unrated (perhaps for now);
  • We will try to conduct them in the ACM-ICPC mode (if there are long waiting lists, we may change the approach);
  • The results that are obtained after the end of the round, are preliminary;
  • After the end of the round will be a 24-hour period of open hacks — any visitor of Codeforces may try to hack any complete solution to a problem of the last round (either from a contest, or from practice), the source code of hacking solution is available (you can copy the text and, for example, stress it);
  • All successful hacks from the previous item will be added to the official test set and after as long as 24 hours after the end of the round retesting of all complete solutions will be made;
  • Only after the final standings based on improved test data, the results are final;
  • The results of a round are calculated separately by division;
  • Our ability to process such problems are limited, so actually the test suites from the jury are expected to end up incomplete — we are looking forward to your hacks!

Basically, we will be oriented towards the members of the second division, but often these rounds will be of interest to more experienced participants.

For now preparing problems to these rounds will be concentrated at the Saratov State University Programming Competitions Training Center, most of the work with the problems will be accomplished by Edvard Edvard Davtyan. We wish him good luck, enthusiasm and energy!

See you at the Testing Round 12, and later at the Educational Codeforces Round 1.

  • Vote: I like it
  • +1052
  • Vote: I do not like it

Comments Comments (190)
| Write comment?
»
8 years ago, # |
← Rev. 2   Vote: I like it +11 Vote: I do not like it

excited! it may be Educational Hackforces Round 1, very very interesting.

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

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.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This is an excellent idea! It will fill gap between classical books like CLRS and problems on rated contests.

→ Reply
»
8 years ago, # |
  Vote: I like it +4 Vote: I do not like it

I am very looking forward to the coming contest ! :-)

→ Reply
»
8 years ago, # |
  Vote: I like it +59 Vote: I do not like it

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..

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it -15 Vote: I do not like it

    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.

    → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it

How will the Educational Codeforces Round be beneficial to the Div 2 participants ? what are the differences between Div 2 and Education Codeforces Round ?

→ Reply
»
8 years ago, # |
  Vote: I like it +9 Vote: I do not like it

I think I'm gonna love Codeforces more and more ! Gooood Job !

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Great , just i wish u make it rated (Educational rounds)

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

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.)

→ Reply
»
8 years ago, # |
  Vote: I like it +4 Vote: I do not like it

(unrated) excited !! :D great thinking mike ! :)

→ Reply
»
8 years ago, # |
  Vote: I like it +133 Vote: I do not like it

Thumbs up if you learned the word "purview" from this post :)

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +32 Vote: I do not like it

    I was too lazy to read the whole post, so I learned it from you. :D

    → Reply
»
8 years ago, # |
  Vote: I like it +19 Vote: I do not like it

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!

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you very much.

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

It is Very Good Idea :) But Please & Please... Good Translation :D Thanks

→ Reply
»
8 years ago, # |
← Rev. 3   Vote: I like it +66 Vote: I do not like it

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.

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    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".

    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 NAME to 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:

    • How to overcome "memorizing problem" mentioned above? The usage of "hashing + map/set" or "hashmap/hashset" can become mandatory in "STRSTR HASHING" with some modifications so the problem won't be solvable by memorizing classical implementation. But it's not a natural reason to learn hashing, efficient data structures, or string algorithms.
    • How to avoid phrase "solve it by 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.
    → Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Great idea, the more CF rounds of any kind the happier I am.

→ Reply
»
8 years ago, # |
  Vote: I like it +22 Vote: I do not like it

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

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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???

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

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! :)

→ Reply
»
8 years ago, # |
  Vote: I like it +7 Vote: I do not like it

Codeforces is becoming the one stop destination for competitive coders (y) .

→ Reply
»
8 years ago, # |
  Vote: I like it +42 Vote: I do not like it

No problems in the test contest.

→ Reply
»
8 years ago, # |
  Vote: I like it +42 Vote: I do not like it

It would be nice to give problems :)

→ Reply
»
8 years ago, # |
  Vote: I like it +19 Vote: I do not like it

I can't see any problems in the test round.

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +24 Vote: I do not like it

cant see any problem?

Celebrate Diwali folks! Happy Diwali :D

→ Reply
»
8 years ago, # |
  Vote: I like it +22 Vote: I do not like it

no problem

→ Reply
»
8 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Problems are not visible to me :(

→ Reply
»
8 years ago, # |
  Vote: I like it +23 Vote: I do not like it

I cant see any problems！

→ Reply
»
8 years ago, # |
  Vote: I like it +1 Vote: I do not like it

No problem statement. Am I the only one?

→ Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Are you kidding with us ?

→ Reply
»
8 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Are we being tested?

→ Reply
»
8 years ago, # |
  Vote: I like it +9 Vote: I do not like it

we have to guess the problems ?!

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Seems that I'm not alone...

→ Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

problems are hard enough to be invisible. :D

→ Reply
»
8 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Testing round : it tests our patience!

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +5 Vote: I do not like it

we learnt that Testing round has no problem.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

where are the problems?

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Works fine, I'm happy

→ Reply
»
8 years ago, # |
  Vote: I like it +12 Vote: I do not like it

the problems are very easy

→ Reply
»
8 years ago, # |
  Vote: I like it +50 Vote: I do not like it

When you first see the contest with no problems :D

→ Reply
»
8 years ago, # |
  Vote: I like it +9 Vote: I do not like it

it seems that the basic functionality didn't remain unchanged :D

→ Reply
»
8 years ago, # |
  Vote: I like it +2 Vote: I do not like it

No Problem!!

→ Reply
»
8 years ago, # |
  Vote: I like it +9 Vote: I do not like it

So the round is to test how the system behaves if there are no problems in an active contest.

→ Reply
»
8 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Yes, MikeMirzayanov and GlebsHP aren't online :D

→ Reply
»
8 years ago, # |
  Vote: I like it +4 Vote: I do not like it

the problems level is too tough that they haven't even kept it in problem set

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Are u testing our patience? -_-

→ Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Time is going on,but problem is waiting.

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Please, brighten up a Wednesday evening a little more :)

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

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?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +38 Vote: I do not like it

    Have you tried turning it off and on again?

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it +12 Vote: I do not like it

      Yes, several times, but it didn't work :(. I'll try formatting the laptop.

      Thanks for the advice!

      → Reply
»
8 years ago, # |
  Vote: I like it +30 Vote: I do not like it

First time to solve all problems in a contest :D

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +22 Vote: I do not like it

    First time there's noone ahead of me after 10 minutes.

    → Reply
»
8 years ago, # |
  Vote: I like it +1 Vote: I do not like it

it seems that I have to study for tomorrow's exam instead of solving blank problems!!

→ Reply
»
8 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Just hack!!!

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

the new round is too hard to see problem

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

like you make your own destiny , you should make your own problems :v :D

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

where is the problems in testing roung now?did i miss something?

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Maybe wrong contest time? :D

→ Reply
»
8 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Can you make this round rated? So everyone will be 1st and earn a lot of ratings.

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    If everyone is first then noone is first.

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      If everyone is first then noone is second.

      → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +18 Vote: I do not like it

It seems that reading all those comments above is more fun than contest itself :)

→ Reply
»
8 years ago, # |
  Vote: I like it +4 Vote: I do not like it

I want sleeping..........

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Wow!!! What a problem set....nice!!!

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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.→_→

→ Reply
»
8 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I want say :6666666666

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I'm tired of waiting you lost one participant, good luck for others with contest

→ Reply
»
8 years ago, # |
← Rev. 3   Vote: I like it +7 Vote: I do not like it

after seen there isn't any problem :(

→ Reply
»
8 years ago, # |
← Rev. 4   Vote: I like it +7 Vote: I do not like it

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 :)

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

+100 for successful hacking attempt of codeforces!

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Keep calm guys.. it's just an error :)

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

please tell me where are the problems. Am I the only one who can not see the problems?

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Sorry, we need to move the round forward for 3 hours.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Well, time to go sleep.

→ Reply
»
8 years ago, # |
  Vote: I like it +24 Vote: I do not like it

Codeforces has finally grow up and it solves its problems itself :D

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

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...

→ Reply
»
8 years ago, # |
  Vote: I like it +1 Vote: I do not like it

there we go, the contest starts 3 hours later :(

→ Reply
»
8 years ago, # |
  Vote: I like it -8 Vote: I do not like it

I solved E by intersection of half-planes!

→ Reply
»
8 years ago, # |
  Vote: I like it +14 Vote: I do not like it

May be it is the longest delay ever in the history of codforces.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

this is a real sad story

→ Reply
»
8 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Am I getting Blind . I can't see any Problem ..... Ummm....

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

we have not enough patience for 3 hours for waiting testing round.

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +12 Vote: I do not like it

delay for 3 hours... I choose to die....

→ Reply
»
8 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Thanks to 3 hours delay, I can now register for the contest. Am I the only one happy about the delay? :D

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

Are there enough jokes about testing our patient in comments or I can add another one?

→ Reply
»
8 years ago, # |
  Vote: I like it +51 Vote: I do not like it

→ Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

So many hacks today!

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Educational rounds, I understand, but what was the purpose of this contest?

→ Reply
»
8 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Awesome competition ! I hacked 12 people on the first task and after that my solution was hacked :)

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

My hacking tests for A were 2 1 1 and 3 1 2.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

tnx alot!!!

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

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.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

good problems ! wish the recent contest problems were as good as this one

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

It was a hacking contest.... :p

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

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.

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

How can we hack solutions after contest or the 24h period isn't for this contest?

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks for the wonderful problems :) Looking forward to the Educational Codeforces Round 1!!

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

can someone please wrap the solution for C into a few words? thanks in advance

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    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.

    → Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

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 :)

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +9 Vote: I do not like it

Maybe a bug: number of solved problems in this round is not shown

UPD: fixed

→ Reply
»
8 years ago, # |
  Vote: I like it +2 Vote: I do not like it

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

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Will there be any editorial for Testing Round #12? (for problem-C) Anybody who can share the idea of problem C?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    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

    → Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

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].

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

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 ?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    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.

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      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.:].

      → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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 ?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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.

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

but also exercises can be used -- what does this mean?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    I mean that for training purpose we often will use not real problems but just exercises: short and formal task on some specific topic.

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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?

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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) ?

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

@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.

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    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!

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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.

      → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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.

    → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

...

→ Reply
»
7 years ago, # |
  Vote: I like it +78 Vote: I do not like it

why there are no educational rounds in recent days ?

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

can anyone tell me where i can find the editorial of codeforces educational round 1 .

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I'm beginner is this contest will help me or its advanced?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    kinda advanced for you. i'll suggest you to try Div3 contests

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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.

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        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

        → Reply
        • »
          »
          »
          »
          »
          4 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Thanks I will do that ^^, but can I focus on certain topics before start solve!!

          → Reply
          • »
            »
            »
            »
            »
            »
            4 years ago, # ^ |
            ← Rev. 2   Vote: I like it 0 Vote: I do not like it

            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.

            → Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
»
3 months ago, # |
  Vote: I like it -32 Vote: I do not like it

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.

→ Reply
»
3 months ago, # |
  Vote: I like it -32 Vote: I do not like it

I'll try to hit 3+!

→ Reply
»
2 months ago, # |
  Vote: I like it -9 Vote: I do not like it

So no rated?:<

→ Reply