Hello everyone!
I'm writing this entry to invite you all to take part in the first edition of Info (1) Cup contest. It is an individual contest with algorithmic tasks and we will accept only C++ sources. The contest itself has 2 parts, both of which held online.
The round 2 is almost over. You still have time to sign up for the online mirror. After the beginning of the round, from technical reasons, you won't be able to register anymore. I invite you all to take part.
The first round of the contest starts tomorrow. As I promised, we'll host an online mirror of it, but due to technical reasons and due to the second round, you'll be able to take it in any frame of 5 hours in an interval of just 16 hours: from time to time . The day after tomorrow, official round 2 followed by its online mirror will go. The online mirror for this round can be taken in a larger interval of time: from time to time, but you can still compete only for 5 hours during a frame at your choice. You can still register to take part in the online mirror for any of the rounds at this link.
PS: As in all the other contests that have online mirrors, I kindly ask you not to discuss the tasks until all the rounds and their online mirrors end. After that, on the official site, you'll find the editorials of the problems.
The first one consists of a national contest in which only invited Romanians can take part and which should be easier. We haven't decided yet whether we'll host an online mirror of it or not and I'll update the post later with this kind of information. We will host an online mirror of round 1 too. We invite you all to take part. We assess the difficulty to be similar to that of a div2 round or even a little lower, so if you are div1 we strongly advise you not to take part in this round, but rather in the second contest described below
The second one is the international contest that I can assure you anyone can take part in. However, as we want the contest to be as similar as possible to international OIs (such as BOI, or CEOI), we want just participants from the official teams of different countries to sign up at the official version. We'll also have an unofficial second contest, similar to an online mirror which you can take in any 5-hours frame for a couple of days after the contest (usaco system). The official round will have a fixed frame . If you consider the time frame good for your country and the country is not listed below yet, I kindly ask you to PM me with information about how to contact any person that may be considered to be in charge with the selection of your country's teams for international competitions to give them the link to the official registration form. Ohh and about the unofficial registration, you'll be able to make an account soon using the official site (LE: Now you can register for the online mirror). The contest will be full-feedback and will use CMS, 5-hours long with 4 problems with all kinds of difficulty level.
Also, about the prizes, we'll award medals and certificates to the winners of the official round,
Ohh and forgot to mention the scientific committee: I'm one of the members together with Alex Niculae and Costin Tudor
The official round 2 is now over. Congratulations to all the participants and special congratulations for those who got a maximum score: Mahmoudian Bidgoli Arash (who finished after just 3 hours and 48 minutes), Alex Tatomir and Mishinev Encho . I hope you enjoyed the contest. Also, we're sorry that, at the 4th problem, we had a limit a little too large which let solutions intended to get 78 points to get a full score. We'd like to address special congratulations to the only contestant that solved the problem in the intended way (that we find pretty tricky and nice and will be explained in the editorial after the ending of the online mirror), Hossein Mohammad Nematollahi.
We kindly ask you not to discuss the solutions until the end of the online mirror. However, we'd be happy to receive any kind of feedback regarding the competition so that we can improve it the next year, doesnt't matter whether it's positive feedback or not.
