For technical reasons, some programming languages (Kotlin, C #) will not be available during round 877. ×

By NALP, 6 years ago, translation, In English,

I'm glad to welcome all fans of programming!

The second qualifying round Yandex.Algorithm will take place today, and it was prepared for you by Artem Rakhov, Michael Mirzayanov and me.

Please pay attention that as well as during the previous qualifying round Codeforces's functionality will be a little cut down for the period of the competition. Don't worry, all will return into place after the round termination.

I remind the best 500 participants pass in Yandex. Algorithm 2011 Round 1 which will take place on May, 20th at 19.00

Good luck!

UPD: the contest is over, congratulations to the winner - tourist!

I recall this competition was a qualifying round, and the best 500 will take part in Yandex.Algorithm Round 1!

Today two participants were the most lucky - Hossein_Hima and ss.nurboolean, - they have taken 499-500 places together with result 978 scores.

Read more »

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

By MikeMirzayanov, 6 years ago, translation, In English,

Hello.

This round will start Yandex.Algorithm 2011. The problems of the round were prepared by me, of course, with the help of the Codeforces team and Yandex.

I hope you enjoy the problems and their solution will start a successful performance at the tournament.

As you have already noticed — the system operates in a somewhat truncated form. We decided to run it in safe mode and turn off some functionality at the time of the contest. After the round everything will be back.

I recall that the top 500 participants will receive a ticket to the first online round of the Yandex.Algorithm. However, if you do not get to qualify at this time, do not despair — you can participate in the second qualification, which will be held on May 6 at 15:00 (UTC).

I wish you have a fun,
MikeMirzayanov

Read more »

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

By Michael, 6 years ago, translation, In English,

We are glad to introduce Yandex open programming competition "Yandex.Algorithm" hosted by Codeforces. The competition starts on May 4th and will consist of two qualification rounds, two online rounds and a final onsite round. Some of the rounds are created by Yandex employees. The onsite round will be held at the Yandex Summer School in Distributed Computing in Moscow Institute of Physics and Technology.

Any registered member of Codeforces can participate. There will be 5 rounds, 2 hours each. 15 winners of the last online round will be invited to participate in the Summer School and in the final round of Yandex.Open. 70 best participants will get T-shirts.

Read more »

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

By ir5, 6 years ago, In English,
Hello.

Today I (ir5) and rng_58 are the authors of Codeforces Beta Round #71. During the contest, you may meet some animals and be asked to solve their tasks.

We sincerely thank for RAD for solving and testing the problems, for Maria Belova for checking the English problem statements, and for MikeMirzayanov for this great system.

Good luck.

UPD:

The round is over. The result was following:

Top 10 participants in the first division:
2. Petr
4. dancho
5. wrong
6. ACRush
7. e-maxx
9. Egor

Top 3 participants in the second division:
3. Tayama

Congratulations!

Editorial (A,B,C,D,E)

Read more »

Announcement of Codeforces Beta Round #71
 
 
 
 
  • Vote: I like it  
  • +155
  • Vote: I do not like it  

By Ripatti, 6 years ago, translation, In English,
Good evening.

I'm glad to welcome you on this Codeforces beta round.

Authors of today problemset are Ripatti (it is me) and Lepetrandr. it4.kp, MikeMirzayanov, RAD, Nerevar and dlevshunov helped in preparing the round. Delinur translated statements into English.

Good luck for all!

UPD
Winner is Neverauskas.
Editorial.

Read more »

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

By MikeMirzayanov, 7 years ago, translation, In English,

Hello!

As you have already noticed the menu will link to the results of the competition has appeared. Drum roll, fanfare, applause, and the blinding spotlight! We congratulate the winners:

  • Winner is Aleksey, 33 score points!
  • The second place — mrButt, 30 points
  • The third place — Sanya_M, 29 points
  • The fourth place — Ruslan, 25 points
  • The fifth place — MaxBuzz, 24 points

Congratulations to all winners! Note that the program by Aleksey has surpassed all expectations of the jury erred solely on hard-to-recognize archives.

I'm asking all winners to send me a private message, we have something to discuss.

MikeMirzayanov

UPD: One test has been found in which the author's answer was incorrect. I've rejudged solutions, but the order of participants has not changed :)

Read more »

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

By Alex_KPR, 7 years ago, translation, In English,
Hi all!

Glad to see you on the Codeforces Beta Round #69. As you suspect, it's not an usual contest.

Every division has 5 problems. Some problems are in both divisions; other are meant for certain division. But from the participant's point of view there are no striking differences from other rounds.

Please notice that such an experiment is the first one, so some technical troubles and unexpected problems are possible. Please treat with understanding if it occurs.

Also: the costs of the problems in the first division are 500-1000-1500-2000-2000. In the second division the costs are classic: 500-1000-1500-2000-2500.

The round was prepared by Alex_KPRdagon and Marishka. Also RAD and it4.kp helped very much. The statements were translated by Maria Belova. The whole process was supervised by Mike Mirzayanov.

Good luck all!
_____________________________________

Don't forget about voting!
_____________________________________

Top 10 participants in the first division are:
Place
Who
1
 vepifanov
2
 KADR
3
 hos.lyric
4
 Zhukov_Dmitry
5
 e-maxx
6
 Romka
7
 ivan.popelyshev
8
 Shef
9
 RAVEman
10
 ktuan

Top 3 participants in the second division are:
Place
Who
1
 Gluk
2
 nvilcins
3
 piloop

Congratutations! Good luck for everybody at the next round! 
_____________________________________

Editorial is here.

Read more »

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

By Ripatti, 7 years ago, translation, In English,
Hello everyone!

I am an author of the today problemset. It is my third contest on Codeforces and the first one for div 1.

I thanks Artem Rakhov, Maria Belova, Pavel Kuznetsov and Mike Mirzayanov for help in preparing of this round.

Happy hacking!

Winner is tourist.
Editorial.

Read more »

Announcement of Codeforces Beta Round #68
 
 
 
 
  • Vote: I like it  
  • +183
  • Vote: I do not like it  

By ahmed_aly, 7 years ago, In English,
Hi everyone,

Today I'll be the author for this round, and it's my first time to be an author in Codeforces. I hope you will like the problems and find it interesting, even for Div1 coders.

I would like to say thanks for Artem Rakhov for solving and testing the problems, for Maria Belova for preparing the problem statements, and for Mike Mirzayanov for this great system.

Good luck and have fun.

Edit 1: Congratulation to the winner Chubcheg.
Edit 2: The problem editorial is here.

Read more »

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

By KADR, 7 years ago, translation, In English,
Hello everyone!

I woud like to announce unofficial translation of All-Ukrainian School Olympiad in Informatics, which will take place on Codeforces at Tuesday, 12th of April at 16:00 MSK. Contest will be based on problems from recently finished All-Ukrainian Olympiad in Infomatics - UOI2011. It will go according to the ACM-ICPC rules. Both teams and individuals are eligible for participation. The contest will be unrated.

We kindly request not to discuss problems from this olympiad before its ending and not to participate in this contest if you already know statement or solution of any problem from it.

The authors are: Daniel Neiter, Roman Iedemskyi, Roman Rizvanov, Ilya Porublyov and me (Iaroslav Tverdokhlib).

The PDF problem statements will be available via links:

Read more »

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