Good day, friends)

Welcome to regular Codeforces round #175 for Div.2 participants. Traditionally Div.1 participants can take part out of the competition.

The problems were again prepared by the group of authors: Pavel Kholkin (HolkinPV), Artem Rakhov (RAD), Fefer Ivan (Fefer_Ivan) and Gerald Agapov (Gerald). Traditionally thanks to Michael Mirzayanov (MikeMirzayanov) for Codeforces and Polygon systems and Mary Belova (Delinur) for translating the problems.

Score distribution is published in advance) today it is standard: 500, 1000, 1500, 2000, 2500.

We open the little secret of this competition, in all today's problems you find permutations)

We wish everyone good luck, successful hacks, high rating and good mood)

UPD1: the contest is over, hope you enjoy it)

UPD2: the tutorial is already published here)

UPD3: congratulations to winners:

1) hechuan
2) TroyI118
3) BekzhanKassenov
4) ahmed_aly
5) lxgsbqylbk

Hello everyone! Codeforces Round 174 will be held for both divisions on Sunday, March 17th at 7:30 PM MSK. The problem setters are abacadaea and me (scott_wu). We would like to thank Gerald for his help in preparing the contest and Delinur for translating the problems. We also thank MikeMirzayanov for creating such an awesome site. We are very excited as this is our first Codeforces round.

For this contest you’ll be helping Farmer John, Bessie, and the cows. We hope you enjoy the problems! :)

The score distribution will be slightly nonstandard.

Div2 — 500 — 1000 — 2000 — 2000 — 2500

Div1 — 1000 — 1000 — 1500 — 2000 — 2500

Good luck and happy coding! As always, to make the round more exciting, we recommend that you take a look at all the problems!

UPD: Our editorial can be found here. Thanks for participating!

Congratulations to the winners:

Div1

1. al13n
2. rng_58
3. HELEN_KK
4. wjmsbmr
5. bmerry

Div2

1. hockey_for_NOI
2. Efremov_licesos
3. Muali
4. koratel
5. lxfind

Hi all! :{

We're glad to invite you to participate in Codeforces Round #173 prepared by A.K.Goharshady, LGM and me (havaliza). I want to thank Gerald, MikeMirzayanov and Delinur who helped us to prepare the round on this platform. And thanks to dani1373, hhoomn, mruxim, MMJ and xorfire who tested the problems and helped us a lot.

Today is LGM's birthday and yesterday was gpac's birthday. Happy birthday to you guys! ^.^

Hope you enjoy today's round and have lots of fun. :)

Update. The editorial is out!

Hello there!

Codeforces Round #172 will take place on Sunday, March 10th at 19:30 MSK(23:30 CST).

This is my second time participating in prepration a Codeforces Round. Last time assist with YuukaKazami is an unforgettable experience. This time, the hardest problems were created by Jiatai Huang(CMHJT) and others by me and Yuping Luo(roosephu).

Testers are sevenkplus, YuukaKazami, pashka and Seter.

We gratefully acknowledge Gerald Agapov(Gerald) for his help in giving advise about the problems, Delinur for her help in translating the problems to Russian, and MikeMirzayanov, who has designed such a powerful platform.

Here let me express my personal thanks to the Codeforces community, which has given me so much gleamy idea in the past two years.

Believe it or not, Codeforces has kept her feet in China's ACM community since last year. AFAIK, some of the hardest problems have been used as this year's Winter Camp homework for our National Olympiad in Informatics.

Also thanks to watashi, ftiasch and xlk. Discussing problem with all of you, has inspired me a lot.

500 — 1000 — 1500 — 2000 — 2500.

We are going to use a standard score distribution in both divisions.

The problemset is a little bit easier than last time, but we still believe, getting all of those five problems accepeted will be a challenging mission even for an seasoned International Grandmaster. The problemset has been marriaged with variety flavor. Take a glance over all five problems before going to coding might be a wise strategy.

UPD:

The contest is over, congratulations to the winners:

Div1:

• UESTC_Nocturne
• liouzhou_101
• peter50216
• Petr
• Shik

Div2:

• antonio_junior
• kyuridenamida
• tsunayoshi
• ZJUT-Xixi
• bird5x

Congratulation to tclsm2012, who also solve the problem D!

We feel so pity to al13n, your last optimization for problem D is wrong. Problem D has a O(mklogn) algorithm. And we are extremely sorry to Jacob, your solution for problem E can pass most of the random tests but actually is wrong.

Jacob... can you explain your solution for us :)

We need collect some feedback about this round .. So the editorial will appear after a period of time.

UPD:

I used to hate those guys who set problems, but didn't write editorial at all! But when things turn to myself, I found it is really difficult to cover all cases. Anyway, it has been done.

Hello, friends)

Soon is coming regular Codeforces round #171 for Div.2 participants. Traditionally Div.1 participants can take part out of the competition.

Again and again the problems were prepared by the familiar group of authors: Pavel Kholkin (HolkinPV), Igor Kudryashov (Igor_Kudryashov), Nikolay Kuznetsov (NALP) and Gerald Agapov (Gerald). Traditionally thanks to Michael Mirzayanov (MikeMirzayanov) for Codeforces and Polygon systems and Mary Belova (Delinur) for translating the problems.

UPD: score distribution will be not standard a little bit: 500, 1000, 1500, 2000, 2000.

We wish everyone good luck, successful hacks, high rating and good mood)

UPD2: the contest is over, we hope you enjoy it)

Congratulations to winners:

1) study_english
2) ipip2005
3) rng_50216
4) bfrcns197
5) csavky103

UPD3: the editorial will be published soon

Hi everyone!

Codeforces Round #170 begins soon, and I'll be the problem setter. I hope many people will be happy to solve all the problems.

UPD: The scoring is dynamic. The problems are sorted by increasing of estimated difficulty.

And the standard part: thanks to Gerald for his help with the problems, Seyaua and sdya for testing the contest, Delinur for translations, MikeMirzayanov for building the Codeforces platform.

Good luck!

UPD: Tutorial

Good Day!

The next Codeforces round will start soon. It will be held by usual Codeforces round rules.

The author of today's round is Mykhailo Granik (Fcdkbear), he is listening the lecture at the Winter Kharkiv Programming School now. Great thank him for this contest!

The score distribution will be standart: 500-1000-1500-2000-2500.

Good luck to all!

Hi everybody! :)

Codeforces Round #168 will start in hours. haas and I (havaliza) are the authors of today's match. I'd like to thank Gerald and Delinur for helping us to prepare this contest and MikeMirzayanov for this great platform.

Hope you enjoy solving the problems as much as we enjoyed preparing them. ^.^

Good luck and have fun. :)

UPD1.

Score distribution will be:

Div2 = standard

Div1 = 500-1000-1500-2000-2000

UPD2.

Congratulations to the winners of both divisions. It's nice that after the contest all five winners of first division are red coders and all winners of the second division are first division coders!

Div1:

1. rng_58
2. Petr
3. Komaki
4. msg555
5. maksay

Div2:

1. qph-Jeremy
2. dojiboy9
3. FreezingCool
4. Hellis
5. yplusplusplusplus

Editorial is out and will be completed soon. :)

Before leaving Tehran I asked SeMeKh a couple of questions on how the training for the competitions works in Iran.

There are local and regional Olympiads in Informatics in Iran which take place across the whole country. Top 40 winners will get together in so-called Golden Camp and train the whole summer, with a break of 2-3 weeks in Ramadan, so the camp duration exceeds 2 months. Part of the participants with lowest scores leave the camp earlier. The rating of participants is classified as either gold, silver, or bronze. "Golden" participants get the right to enter any university in the country without Concur. The 4 participants of IOI are also selected from the "gold" category. Please note, that there is no national Olympiad in Informatics. — see note below.

Iranian competitors achieved following results in the International Olympiad in Informatics:

• 2012, Italy — two gold (mR.ilchi, havaliza), two silver (LGM, mruxim) medals.
• 2011, Thailand — three silver (including SeMeKh and sajad22), one bronze (kasnavi) medal.
• 2010, Canada — gold (a70babat), two silver (Mehrdad, SeMeKh), one bronze medal.
• 2009, Bulgaria — gold (a70babat) and three silver (including pooya_, Solej) medals.
• 2008 — unfortunately, Egypt didn't grant visas to the team of Iran.
• 2007, Croatia — gold and three silver (including Saeed_Reza) medals.

As you can see, results are very high, all 4 pupils normally get medals, there is often a gold one. Many organizations support and organize high school students for comptetion, which is unfortunately not the case with university students. I have not heard of a well-organized system of training for ACM ICPC in the country. Hopefully, the situation with support from universities, government and business will change, and I suspect it is a local business who will initiate the change.

There were not enough time to discover more details, so I will be happy to here rich comments from Iranians on the topic as well as tough questions from everyone interested.

UPD. Please see important comment from A.K.Goharshady below.

UPD 2. Here are some numbers from inoi.ir. There are about 10000 participants in the first stage. About 1000-2000 qualify to the second stage, which is a two-day event which includes multiple-choice test and a kind of examination. Some 60-70 people go to the stage where they solve problems using a computer, 35-40 summer camp participants will be selected here. There are 8 gold medalists at the camp, 4 of which will then take part in IOI.

Hi everybody, it's 11:10 local time at Tehran, I'll tell you how the Bayan Programming contest 2013 (1391) onsite Finals is progressing.

22:17. Peter50216, cerealguy and Egor are top-three! Congratulations!

22:05. Closing ceremony. The rejudge took place for one problem.

18:30. Not everything of Funkoders has been judged yet, so the results of this additional fun contest will come later.

18:29. It's over!

18:27. Announcement: two minutes to the end of the contest. It should have 5 though.

18:10. It's a fun competition, so there are two guys entertaining competitors and spectators:

18:04. Every couple of minutes one of the baloons exploid, making a person next to it jumping up.

17:54. Only the first submission will count. There are 15 problems. Competitors hope that the problems are not harder than in the main round.

17:51. Let's begin!

17:50. Funkoders challenge will last 42 minutes and will contains lots of problems.

16:26. The contestants are having lunch now, afterwards the Funkoders Challenge is scheduled — a contest for fun. While you are guessing about the winner's name, I'll announce the winner of our "guess-the-wireless-password" contest. Actually, nobody had it 100% correct. The password was "bayan", so MikeMirzayanov who suggested "Bayan" is winning a special prize: he won the right to contribute to Codeforces completely free of charge the whole day tomorrow, on Sunday! Congratulations!

16:05. The contest has finished!

16:00. Five minutes until the finish of the contest.

15:35. Half an hour before the contest end (again). Here are some details about "rejudge". The score for each problem depends on submission time, number of wrong tries and number of people successfully solved that problem. So, after the contest end everything will be rejudged to double-check and make sure the final results are correct. Discrepancies, if any at all, will be investigated manually.

15:19. Announcement: 45 minutes until the end of the contest. Ranklist will not be updated anymore. Some rejudges may take place.

15:13. Current standings:

• cerealguy C, F, G
• peter50216 A, F, G
• Egor A, F, G
• watashi A, F, G
• Solej A, F
• Dmitry_Egorov A, F
• havaliza A
• _M_ A
• poopi A
• LGM F
• anrieff F
• ali_fiujnomali F
• a70babat F
• liympanda G
• m.sabouri G
• kelvin F
• haas F

15:05. Announcement: according to the jury team decision, the contest duration will be extended by 30 minutes.

15:02. Half an hour till the end. I see a small chance that the contest will be prolonged.

14:45. With baloons it looks like this (larger photo here):

14:36. There are few more people who solved one problem: havaliza, Nick name, liympanda and cheshme.

14:34. Baloons are distributed now for every solved problem: green is assigned to the most popular task F.

14:20. Announcement: please check clarifications, the constraint for interactive problem is published now. The interactive problem will not be removed from the problemset, although this possibility has been considered before.

14:18. The problems are hard, there are not many submissions.

14:16. Nicknames of Galapagos, fmwviormv and Haas do not match those on TopCoder. Also, cerealguy uses a nickname mikhail in the contest today.

14:11. We have a new leader: peter50216 with A, F, G. Then cerealguy — F and G, mruxim, Galapagos with A, watashi with G. Then come anrieff, fmwviormv, kelvin, Haas, Egor and Dmitry_Egorov with F.

13:59. watashi is on the second place at the moment with problem G. He is followed by mruxim, peter50216 and Galapagos who solved problem A. Three more people with problem F follow: kelvin, Egor, Dmitry_Egorov.

13:55. Almost the half of the contest has passed, and we have just 8 people who solved at least one task. Just recently cerealguy has got his second accepted and he dominates the ranklist with problems F and G.

13:53. I hope you missed me. I missed Iranian food so much, so I had to have a lunch break. Standings follow.

13:01. Announcement: please check clarifications. (One of the constraints has been fixed.)

12:57. It is very quite in the contest area. Egor is the only one with his headphones on, he codes something thoroughly, looking at the problem statements frequently.

12:43. There are 7 problems for three hours. Unfortunately, there is no standings table available on the web.

12:40. cerealguy seems to be the only one who brought Mac to compete on. He seems to write a code for at least 3 minutes now.

12:33. Contestants have printed versions of problems.

12:32. THE CONTEST HAS STARTED!

12:31. My laptop shows Swiss time, which is 10:01 now, and I'm getting very good in adding 2.5 hours to it to put a timestamp in Iranian timezone to each update.

12:28. One problem may be removed from the problemset, because the are some difficulties with it. We hope to begin soon.

12:26. By now everyone should be logged in with their username and password.

12:18. Four executables are available: {32-bit, 64-bit}x{Windows, Linux}. SeMeKh: "I hope nobody has any other OS."

12:14. Contestants can test their solution to the interactive task locally, providing the simulator with N (size of task) and a random seed. The simulator will generate a hashed result ("secret key"), which can be submitted to the judge.

12:11. Mehran apologises for the delay and encourages the participants to make themselves familiar with interactive problem. Every announcement is made in English and in Farsi.

12:05. Here is the contest area:

12:02. There 56 contestants here, representing Iran, Russia, China, Taiwan, Bulgaria.

11:52. All of the password guesses in comments correctly spotted the main keyword of the contest :-) But there is no 100% correct answer yet.

11:49. Network issue is resolved. SeMeKh announces, that one of the problems will be interactive, the binary executable will be available.

11:38. It has been anounced, that one of the contestants has problem with network. We'll try to fix it and start as soon as possible.

11:27. All contestants have entered the competition area. Mehran, one of the problemsetters from Bayan, has announced the Wi-fi network name and password where contestants have to connect. Can you guess the password?

11:13. While you wait for updates from me, you can read the first part of my nano-research on how it works (can also be read as "IT works") in Iran. Or just look at the pictures from the first two days in Tehran.

11:11. With a delay of about one hour contestants started to enter the competition area.