By PavelKunyavskiy, 7 years ago, translation, In English,
Hello everybody and welcome to the first summer round - Codeforces Beta Round #73.

Today we are the authors of round: kuniavski (Pavel Kunyavskiy) and Zlobober (Max Akhmedov). Competition will take place in both divisions. Totally there will be 7 different problems with variations in divisions, 5 in each division. We hope everybody shows their best and solve as many problem as they can.

Thanks to RAD (Artem Rakhov) for the help and advices in preparing of the round,  Delinur (Maria Belova) for the problem translation and  MikeMirzayanov (Michael Mirzayanov) for such a great site.

GL & HF!


Tutorials: div1,div2

Congratulations to the winners

Div1 - ilyakor 
Div2 - peter50216

Some statistics. First sucsessful submits and hacks:

Div1-A Dmitry_Egorov 4:09
Div1-B ilyakor 13:05
Div1-C A_A_Lunyov 8:05
Div1-D hos.lyric 30:57
Div1-E rng_58 75:20
hack VArtem 26:15

Div2-A epizend 5:27
Div2-B random.johnnyh 19:15:29
Div2-C RomaFurko 11:31
Div2-D peter50216  41:18
Div2-E peter50216 54:00
hack  diogen 55:33

Read more »

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

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

Translated by Maria Belova

I continue the narration about the ACM-ICPC 2011 finals.

 

At last we got to the championship's opening :). A classic breakfast slowly but surely transferred into Bill Poucher's speech. Besides inviting his numerous colleagues to the microphone to say a couple of words, he made all the teams, volunteers and organizers stand up for greetings. In other words, he was having fun in every possible way.

Soon all the participants were gathered by the Plaza International Hall where the contest's trial rounds and the main round were held. Yes, remarkable as it is, there were as much as two trial tests! ;)

The first round started after the opening, the participants were offered 4 triplicated problems which equals 12 problems. =) We boosted our morals any way we could, the atmosphere was not exactly laid-back because nothing went okay, as usual. We narrowly managed to solve one problem by the end. By the way, that was us who had the Illegal Function verdict as we tried to calculate and write in the file. Later I overheard the Head Admin being very dissatisfied with the fact. :)

Read more »

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

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

Translated by Maria Belova

Hi everybody =)

 

So, the first day I'll start the narration from is the day of journey from Orel to Orlando. However lexicographically close the two cities might be, the distance between them is not small at all!

The journey began on the vice rector's car. There already is a funny story connected with that car: in exactly the same manner we set off for Budapest. Then, on our way to Domodedovo, the transport sensed that there were unusual people inside and just wouldn't go any further. As a result, our team, sleepy and scared, tried to hitchhike at 2 a.m. to get to the plane in time =). But that's a whole different story. This time, all went well, the car recognized us and didn't rebel against our presence.

Despite the rumors that due to an eruption flights are delayed because the airplanes fall right in the volcano in the centre of Europe, all went well. In four hours we arrived in London right on the schedule. And after six hours of fooling around we're on the plane again. This time it's already London-Miami. And yeah, at last, after 9 exhausting hours of flight accompanied by Vivaldi music, we're in Miami.

Read more »

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

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

Hello!

I remind you that tomorrow will be ACM-ICPC World Finals Contest which will begin at 13:00 (UTC). The live results probably will be available by the links: http://zibada.ru/finals/ or http://icpc.baylor.edu/.

Watch! Ail! Share your impressions!

Read more »

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

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

On May, 25 in the evening we attended a dinner show called "Treasure Tavern". Dinner combined with show is a rather popular entertainment format here. There were several variants and we chose this as the least childish one. In fact, the show combined elements of a stand-up comedy, a musical and a circus. It all was spiced up with the entourage of a kind of a cabaret tavern with waitresses in short dresses. However, apart from a dosen of vulgar jokes the tavern theme didn't develop. During the show we didn't understand lots of stuff, but the artists' performance was on the top level. We were impressed by a dancing couple, where the woman was sometimes hidden for literally a second behind a special curtain and the next moment she appeared in a new garment. The gymnasts' performance was also on the top level. We weren't particularly impressed by the food, but on the plus side, it was the first time I've tasted meat with blood and I liked it. On our way home Artem even went to Burger King (I understand him).


The performers tried to make a superstar out of Kolya but he refused

Read more »

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

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

The train number nine from Saratov to Moscow was a pleasant surprise. Every compartment in our wagon had a small TV, outlets, and each passenger could use a personal safe with a code lock. Of course, we didn't turn the TV on and didn't use the safes. Imagine how ironic it would be if we put there, say, a passport and forgot the code number.


Note that there's not only a TV, but also also outlets behind Nickolay.

In Moscow we had a little snack in some seedy railway eatery (in fact, Kolya and Artem went to Mcdonalds) and got on an express to the Domodedovo Airport. The fun lasted 40 minutes and cost 12 USD rubles each. Russian Railways have a good business!

Read more »

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

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

Today Saratov delegation will go to the championship's finals. As you remember, we've been planning to go to Sharm El-Sheikh since January, watching their great February revolution anxiously. As a result, the finals were moved to Orlando (Florida, USA). Our delegation got a little smaller too, as May is a hot month and it's a long way from Russia to the USA.

Our team is famous on Codeforces. And that's not surprising! Just look at them:

  • Maxim Ivanov (e-maxx) spends considerable time among the top rated users and among the top contributors. Many know his wonderful site http://e-maxx.ru/, of course. Attentive users recognize him as a determined bug filer in gcc issue tracker and an author of some contests. Maxim is on the fifth year in SSU Mechanics and Mathematics Department and his interests include "programming, programming and... oh yeah, programming :), zen, taoism, philosophy, psychology, the bike".
  • Artem Rakhov (RAD) is known as the Codeforces problems' coordinator, the participant of all on-site prestigious competitions (TopCoder Open, Google Code Jam, Faceboook Hacker Cup) and a great Cola fan. Personally, I've known Artem since the eight year at school and I shudder to think how many problems he has solved since then :)
  • Nikolay Kuznetsov (NALP) is known as the author of several rounds and the one who fights ardently for clear statements. He used to be in one team with Artem back at school days. I remember how surprised I was when I learned that he got to TopCoder High School Competition. Nikolay is a third-year student of the Department of Computer Science and Informational Technologies of SSU and he is my student. On July, 10 I exam him on the theoretical course in Programming Methods. By the way, Kolya, let me remind you that you haven't yet got the pass for the practical work!

Besides, the team has me as the coach and Antonina Fedorova as the team leader.

I will do my best to keep you up to date on how the trip's going (mostly on the actual finals, of course). However:

I urge the participants of the event not to keep their interesting impressions hidden and bottled up. I want you to share them. For example, you can publish them on Codeforces!

As a conclusion to the entry, I want to ask a question to those who have already planned the whole trip. As far as I understand, the couple of days before the finals in Orlando won't be spent uselessly: there are some grand amusement parks around. I've got a question to those who are prepared and to those who are keen on that: which place will be most interesting for the ACM-ICPC team? As far as I understand, the tickets to those parks are not exactly cheap, but in one can get a discount now and then - how should we purchase the tickets?

Just in case I inform the Saratov residents that we leave today, on May 23, on train 9.

---
Packing his bag, Mike Mirzayanov

Read more »

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

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

Hello, dear participants and spectators!

Let me remind you that the elimination phase of the open programming competition "Yandex.Algorithm" comes to an end. With it this means that the time for the most important event of the phase has come: the elimination round for the finals (finals will be held at the Yandex Summer School)! This means that today two hundred best participants of the tournament (based on the results of the previous qualification rounds) will compete to get into the top-15 of the world olympiad programming community.

We hope that the round will be appreciated not only by the participants but also by the spectators, who will have the opportinity to watch the events developing for at least two hours.

Please, pay attention to the problems' costs: 500, 1000, 2000, 2500, 2500. I also advise you to read all the statements, as the choice of the costs and the order is certainly subjective.

Round will be rated for all the participants (including those competing hors concours).
Good luck to the participants. The problems are going to be rather hard, so you'll have to do your best!

I also wish a spectacular round to the rest!

Round is over. According to the results, 20 participants solved at least three problems, and just one (the winner) was able to solve the fourth. The first three places were taken by Petr Mitrichev, Gennady Korotkevich and Sergey Kopeliovich. Congratulations!

In addition to this, 15 leaders advanced to the finals: Petr, tourist, Burunduk1, ivan.metelsky, dzhulgakov, e-maxx, LayCurse, rng_58, pieguy, zeliboba, ktuan, levlam, wata, dolphinigle, Progger .

Problems proved to be rather tough. Here's the full analysis.

Read more »

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

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

We are glad to welcome all contestants of a qualifying contest "Yandex.Algorithm 2011 - Round 1".

Today's round authors are Vitaly Goldshteyn, Ignat Kolesnichenko, Stanislav Pak and Denis Yarets. All we are employees or interns of Yandex. We really appreciate Artem Rakhov, Maria Belova and Mike Mirzayanov who helped us to prepare the contest. We hope that our tasks will be quite interesting and you will get much fun solving them.

As you may know top 200 contestants after this round will be able to continue fighting for spots in the final round.

Please pay attention that as well as during the previous qualifying round Codeforces functionality will be a little cut down for the time of the competition. Do not worry, all will return into place after the end of the round.

Round will be rated for the official participants, and for those who failed to qualify and participate out of competition (unofficial).

Good luck and high rating for everyone!

Tasks analysis: C

Read more »

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

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

Welcome to Codeforces Beta Round #72.

The authors of the round are: Kholkin Pavel, Nikolay Kuznetsov and Kaluzhin Alexander. This round is for both divisions. You will get different problems and we hope that every participant solve as much problems as he can.

Thanks to Rakhov Artyom and Pavel Kuznetsov  for their help, Mary Belova for translating problems and Mike Mirzayanov for the perfect system.

The main hero of the problems is Valera. Today you should help him in everything. =)

Good luck and high rating for everyone =)

Upd: the contest is over, congratulations to winners:
in div1 - tourist
in div2 - StelZ40494

Read more »

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