Comments
0

You should join the group first in order to view the contests inside.
+3

Fixed. You may try them now.
+3

EOI18 and IOI qualifications 2019 have been added.
0

Added them to the group and the blog.
+8

I will try to add them as soon as possible.
+1

EOI'17 Onsite contests problems have been added. You may try them now.
+9

Yes, They will be added soon.
0

Fixed, please try again.
On albertg → Codeforces round #382, 10 years ago
+16

It happens that 2 problems coincides not only between 2 OJs but in the same OJ.

Last round (Codeforces Round 381 (Div. 2)) problem 740D - Alyona and a tree was the same exact idea as problem 101147J - Whistle's New Car from contest 2016-2017 ACM-ICPC, Egyptian Collegiate Programming Contest (ECPC 16) not the statement or author or anything, but it is the same exact problem (only input format differs). Possibly Telepathy!

I think this is almost the same exact situation here. So it wouldn't be a big problem if this round remains rated.
On Eran → Codeforces Round #365 (Div. 2), 10 years ago
+9

Is the time correct? Edit: It's fixed now.
0

Here is another interactive problem to try from (2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest):

J. Just Another Disney Problem
+3

In the first line the DFS function:

bool sure;

There is an initialization missing here.

I believe it should be like

bool sure = false;

Right? This will make you pass that test.
0

Yes cur means what coin I am adding right now .
0

Edit : the solution had some mistakes , however it passed as a complete search !! :O :'D AC CODE : 12947069
On HarveyCipher → Ramadan Time, 11 years ago
+16

Exactly ^ , when I thought about this , I realized that whenever a contest would be , it might coincide with somebody's schedule .. If you managed to make it good for some places , it will not be comfortable for some other places .. Simply , You can't make everyone happy , I guess time management is the most acceptable solution here .

0

It's not about a whole team , but each member ..

Five Regional as total ( Regional Contests ) .

A student who has competed in five Regional Contests is NOT eligible to compete ( Regional Rules ) .
On n8118 → Bfs using recursion, 11 years ago
+8

BFS can't be done by recursion as BFS goes level by level , which can't be done by a recursive function which goes as deep as it can then go back when it ends a path and so on .