931A - Friends Meeting

At first understand the fact that friend should make their moves one be one and the friend who initially was left should move to the right and other friend should move to the left. Let len = |a - b|. Then the first friend will make cntA = len / 2 moves, and the second friend — cntB = len - len / 2 moves. So the answer is the sum of two arithmetic progressions cntA·(cntA + 1) / 2 and cntB·(cntB + 1) / 2.

The given constrains allowed to calculate this sums in linear time — simply iterate from 1 to cntA for the first sum and from 1 to cntB to the second.

Thanks GreenGrape for translation!

Hello everybody!

Today, on March 4th 2018 the final round of Technocup olympiad for Russian-speaking high school students is held. The round starts at 11:30 Moscow time.

After the round starts, you can watch the current results.

For those who want to compete on the same problems, we will host two Codeforces rounds: one for the first, and one for the second division. The rounds will start at 15:35 UTC, don't miss them!

If you compete in the Final Round today, you can't compete in the rounds at evening.

The problems are prepared by Endagorion, komendart, rationalex, AndreySergunin, fcspartakm, MikeMirzayanov and me. For testing the problems many thanks to demon1999, Belonogov, vintage_Vlad_Makeev, adedalic, budalnik, GreenGrape, Neon! Also many thanks to vintage_Vlad_Makeev for his help in hosting the round at Codeforces!

P.S. Because of the olympiad, some Codeforces features may be disabled today.

Good luck!

UPD: Congratulations to Technocup winners!

1. qoo2p5
2. dima_z
3. 300iq

Congratulations to winners of Codeforces rounds!

First division:

1. V--o_o--V
2. Petr
3. Merkurev
4. Benq
5. dotorya

Second division:

1. Deanamic_Programming
2. kiber
3. shad0w_walker
4. Vitalya
5. Geothermal

I'm sorry for the delay, it took some time for me to translate analysis to English.

Problem author: KAN, preparation: KAN.

Problem author: KAP, preparation: KAP.

Problem author: KAP, preparation: demon1999.

Problem author: ZhNV, preparation: ZhNV.

Problem author: SYury, preparation: kuzmichev_dima.

Problem author: KAP, preparation: KAN.

Hi!

The Codeforces Round 464 (Div. 2) is going to be held on Saturday, 17 February 2018 at 10:05 UTC for participants from division 2.

The round is based on XIV Nizhny Novgorod Olympiad in Informatics named after V. D. Lelyukh for high school students, which will take place on Saturday in Nizhny Novgorod. However, the problems for the Olympiad and for the round are not completely identical.

The problems were prepared by KAP, ashmelev, ZhNV, kuzmichev_dima, demon1999, SYury, mmatrosov and me. Thanks to mike_live and vepifanov for testing the problems, and vintage_Vlad_Makeev and MikeMirzayanov for helping us to host the round on Codeforces!

As usual, participants from division 1 can take part out of competition.

Good luck and have fun!

UPD: There will be 6 problems with the following scores: 500-1000-1500-2000-2500-2750.

You will be able to view submissions and tests after the end of the olympiad in Nizhny Novgorod around 13:30 UTC.

Congratulations to winners!

Div. 2:

1. LitiIsPretty
2. heuristica
3. Panole2333
4. S.H.I.E.L.D
5. OYZYWIN

Div. 1:

1. dotorya
2. eddy1021
3. DmitryGrigorev
4. uwi
5. georgerapeanu

The editorial is here.

Hi all!

This weekend, at 16:05 UTC on November 12th, 2017 we will hold Codeforces Round 445. It is based on problems of Technocup 2018 Elimination Round 3 that will be held at the same time.

Technocup is a major olympiad for Russian-speaking high-school students, so if you fall into this category, please register at Technocup 2018 website and take part in the Elimination Round.

I want to thank MrKaStep, komendart, veschii_nevstrui, bixind, AndreySergunin and DPR-pavlin, who authored and prepared problems for Technocup, and Lewin, who kindly suggested the last problem. I also want to thank zemen and AlexFetisov for testing the round.

Div. 1 and Div.2 editions are open and rated for everyone. Register and enjoy the contests!

UPD: We apologize that we run into technical issues during the round. The round will be unrated. I hope you liked the problems.

Anyway, congratulations to winners!

Технокубок 2018 - Отборочный Раунд 3

1. potapov_al
2. 300iq
3. qoo2p5
4. Vosatorp
5. manoprenko

Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3)

1. V--o_o--V
2. Petr
3. Um_nik
4. SirShokoladina
5. LHiC

Codeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)

1. mosthenio
2. Ingus
3. paulsohn
4. xX_ucfNOTpt_Xx
5. Omar_Morsi

Editorial is published.

Thanks Arpa for this editorial!

Thanks Arpa for this editorial!

The analysis is being updated.

Thanks Arpa for the proofs!

Hi!

On Thursday, July 13, 2017, at 15:05 UTC Codeforces Round #424 will be held. Some of the problems will be from VK Cup 2017 Finals, some are prepared by Codeforces team to complete the problemset.

There will be six problems in the second division, five as usual in the first, three of them shared. The problems of this round are proposed, prepared and tested by: send_nodes, akvasha, ilya_the_lamer, fcspartakm, Perforator, MikeMirzayanov, PavelKunyavskiy, qwerty787788, Belonogov, izban, tourist, vepifanov, AlexFetisov, winger, Errichto, Gassa, naagi, ashmelev, Endagorion, ifsmirnov, Arterm and me. Huge thanks to all who helped with the preparation!

There will be prizes from VK social network in this round as well! Namely, among participants solved five or more problems in second division, or two or more problems in first division, five are to be selected randomly. They will receive championship souvenirs. There is no country nor language restriction, everyone can win a prize. One don't have to have participated in VK Cup to receive the prize. Exact selection algorithm will be announced before the start of the round.

Good luck!

Congratulations to the winners!

Div. 1:

1. Syloviaely
2. jqdai0815
3. Petr
4. anta
5. matthew99

Div. 2:

1. ccz181078
2. repeating
3. ioyeoa
4. ReaLNero
5. beet

The analysis is here.

The problems correspond to problems of VK Cup 2017 - Finals as follows:

• Problem 830C - Bamboo Partition — is problem 823C - Bamboo Partition, author is me;
• Problem 830D - Singer House — is problem 823E - Singer House, authors are send_nodes and me;
• Problem 830E - Perpetual Motion Machine — is problem 823F - Perpetual Motion Machine, authors are akvasha and ilya_the_lamer.

Congratulations to souvenir winners!

Hi!

On Tuesday, July 11, 2017, at 16:35 UTC Codeforces Round #423 will be held. Some of the problems will be from VK Cup 2017 Finals, some are prepared by Codeforces team to complete the problemset.

Note that there will be two rounds based on VK Cup Finals, so I want to ask finalists not to discuss problems until the end of the second round.

There will be six problems in each division, four of them shared. The problems of this round are proposed, prepared and tested by: vintage_Vlad_Makeev, demon1999, fcspartakm, Perforator, MikeMirzayanov, PavelKunyavskiy, qwerty787788, Belonogov, izban, tourist, vepifanov, AlexFetisov, winger, Errichto, Gassa, naagi, ashmelev, Endagorion, ifsmirnov, Arterm and me. Huge thanks to all who helped with the preparation!

There will be prizes from VK social network in this round! Namely, among participants solved five or more problems in second division, or three or more problems in first division, five are to be selected randomly. They will receive championship souvenirs. There is no country nor language restriction, everyone can win a prize. One don't have to have participated in VK Cup to receive the prize. Exact selection algorithm will be announced before the start of the round. There will be prizes in the second round using Finals' problems as well!

Good luck!

Congratulations to the winners!

Div. 1:

1. W4yneb0t
2. jqdai0815
3. ko_osaga
4. Radewoosh
5. dotorya

Div. 2:

1. ccz181078
2. _rqy
3. houruize
4. _Is_It_Rated_
5. liutianyi000

The analysis is here.

Corresponding problems from VK Cup 2017 - Finals:

• Problem 827B - High Load is problem 823A - High Load, the author is MikeMirzayanov;
• Problem 827C - DNA Evolution is problem 823B - DNA Evolution, the authors are MikeMirzayanov and me;
• Problem 827E - Rusty String is problem 823D - Rusty String, the authors are vintage_Vlad_Makeev and demon1999;
• Problem 827F - Dirty Arkady's Kitchen is problem 823G - Dirty Arkady's Kitchen, the authors are demon1999 and vintage_Vlad_Makeev.

The souvenirs winners are:

Congratulations!

Today, on July 9, 2017 the VK Cup 2017 Finals is being hold in Saint Petersburg!

Just to remind you, the total prize fund is 2490368 rubles, 20 teams consisting of 39 contestants in total will fight for it. Past years champions are tourist and niyaznigmatul in 2015, and tourist and subscriber in 2016. Who is going to take the first place today?

You can watch live results of the competition here, the start is at 08:05 UTC.

Good luck to all contestants and fans!

Final standings

UPD: Hooray! The results of the final competition were summed up. Congratulations to the winners!

1. ershov.stanislav, aid,
2. V--o_o--V, LHiC,
3. enot110, I_love_Tanya_Romanova,
4. zemen, Zlobober,
5. nikgaevoy, tranquility,
6. RomaWhite, witua,
7. Trumen, felix,
8. Rubanenko, MrDindows,
9. Temirlan, akim,
10. Golovanov399, -imc-,
11. Goofy57, Shapo,
12. ztk, ballon,
13. Vladyslav, Omelianenko,
14. Seemann, bezhimr,
15. Temirulan, Aidos.
16. EvErka, greencis,
17. IlyaLos, danilka.pro,
18. YakutovDmitriy, budalnik,
19. Lilith, Copymaster,
20. SergeiFedorov.

During the discussion after the Round 421 it turned out that the author's solution was wrong. Yes, we had several testers, we had a bruteforce solution that worked correctly, we had a stress testing between the bruteforce and the main solutions. However, all these measures haven't prevented the mistake: the testers haven't noted the issue, the stress haven't found any counter-tests. The solutions also produced the same answers all small tests we had in the testset, so we only found the issue when a test used for a hack was added.

We are terribly sorry about the mistake. We did our best to ensure the problems are ok, I don't know any available method that we haven't used to check the problem.

We've spent the last few hours trying to come up with a new, correct solution to the problem, but right now I don't see any solution that seems undoubtedly correct to me. There are a few that work better than the author's, but yet unproved, you can try to prove this one, for example. I think this problem should be solvable with careful case analysis, and I'm trying to do this right now. I'll post the results here. I'd also be glad if someone post the solution with proof.

Thus, I apologize that the round should be declared unrated. Hope for your understanding.

Hi all!

Tomorrow, on April 5th 2017, at 15:35 UTC the first Wild-card Round of VK Cup 2017 will be held. Along with it there will be parallel unofficial round in which everyone can take part.

The rounds will use special rules, the rounds will be unrated. The problems were prepared by Codeforces team.

The detailed rules will be added to this post 30 minutes before the rounds. I can say now that there will be 24-hours open hacks phase after the round, like in Codeforces Educational Rounds.

Round rules:

The round will be almost usual contest with ACM ICPC rules. There will be 12 problems for 2 hours. During the round your solutions will be tested on some basic tests, they should be much stronger than usual pretests. After the round you will have 24 hours to find tests against other participants’ solutions, this part is the same as in Educational rounds. After that we will add all succesful hacks and our tests and rejudge all submissions. Then the results will be final.

The main difference between ACM ICPC rules and this round is the following rule.

You should submit each problem in a unique programming language. Different compilers of same language are considered the same language. For example, GNU G++, GNU G++ 11, GNU G++ 14 and MS C++ compilers are C++ language. Thus, you are not only to solve problems, but also try different and new for you languages. We don’t think you know 12 languages, we hope that you will quickly learn some basic syntax.

Formally, the following check is performed when you submit a task:

• If there is at least one submission in queue or submission that passed at least one test for this problem in another language, your solution will be ignored. Thus, if your program passes at least one test, you can only solve this problem using this language.
• If there is at least one submission in queue or submission that passed at least one test for another problem in same language, your solution will be ignored. Thus, you can’t use a language for more than one problem.

Remember that you can view filter status of some other round by language and view submissions in a specific language. Also, you can view examples of codes in any of the supported languages on the table below. Also, the table contains the groups of compilers considered the same language.

You can use “custom invocation” tab to run a solution if you don’t have the compiler locally.

The main rules of ACM ICPC contest: each problem can either be completely solved (when all tests are passed), or not solved. The participants are ranked by the number of solved problems, in decreasing order, in case of a tie they are ranked by penalty time. The penalty time is the sum among all problems the time in minutes that had passed between the start of the round and the moment the problem got solved, plus 20 minutes for every rejected submission. Note that the problems are not arranged by difficulty. Also, you can resubmit a solution even if it passed all tests, because there will be more tests after the open hacks.

Good luck!

Open hacks phase has ended, the solutions are rejudged. Congratulations to winners!

Official round:

1. StarScreamOwl, ednotdead
2. VernitaGreen, svxf
3. gars, Provet
4. Me-and-Myself, ultizet
5. svetlana_lana, GoldenMan

Open mirror:

1. Lewin
2. oversolver
3. uwi
4. ifsmirnov
5. Tinsane

Hello everybody!

The Technocup 2017 (a competition for high-school students hosted by Mail.Ru Group together with MIPT, Bauman MSTU and Codeforces) Finals is happening tomorrow in Moscow. For those who will not participate in the Finals, we prepared mirror contests for both divisions. The round will start at 13:05 UTC at Sunday, March 5th, 2017 and will last for two hours.

The round was prepared by Endagorion, WHITE2302, Alladdin, fcspartakm, Amethyst1, MikeMirzayanov, ifsmirnov and me.

You can view the current onsite results at link.

There will be six problems in each division.

Editorial is here.

Hi!

The Codeforces Round 398 (Div. 2) is going to be held on Saturday, 18 February 2017 at 9:05 UTC for participants from division 2.

The round is based on XIII Nizhny Novgorod Olympiad in Informatics for high school students named after V. D. Lelyukh, which will take place on Saturday in Nizhny Novgorod. However, not all problems from the Olympiad are included into this round.

The problems were prepared by KAP, ashmelev, ZhNV, kuzmichev_dima, mmatrosov, mike_live, arsor and me.

You will be given two hours to solve five problems. As usual, participants from division 1 can take part out of competition.

Scoring: 500-1250-1500-2000-2500.

UPD: The contest is over, thanks to all who has participated! Congratulations to the winners:

Div. 2:

1. lucyanna2018
2. Imperishable-Shooting
3. aduiduidui
4. Cth1999
5. mister_dudec
6. FallDream
7. Illidan
8. Alex342
9. A.Magdy7 and TmEnd

Div. 1:

1. eddy1021
2. HellKitsune
3. I_love_Tanya_Romanova
4. vintage_Vlad_Makeev
5. latte0119

I apologise for the problem difficulty of the problem B, we expected much more accepteds. Hope you liked the problems! The editorial will be posted in 1.5 hours after the Olympiad is finished. Editorial.

We know about the issue with ratings, they will be rolled back and then updated properly. Don't worry.

Hi Codeforces!

The Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) is going to be held tomorrow at 8:05 UTC!

This round is organized in collaboration with Hello Barcelona ACM ICPC Bootcamp 2017 and supported by Kaspersky Lab.

Over 100 students from 17 countries and more than 25 universities such as Cornell University, University College London, École Normale Supérieure, University of Tokyo, Saint-Petersburg State University and Moscow Institute of Physics and Technology gathered in Barcelona to train together for the ACM ICPC Finals.

For eight days students have been solving problems, listening to lectures, learning and making new friends. The training schedule is intense consisting of full-length practice contests, interleaved with one-day educational modules on topics we find especially important. Every contest is followed by an in-depth explanations of every problem and technique encountered in all forms.

Can't download http://assets.codeforces.com/files/barcelona-2017/photos/list.txt [tried twice].

It is hard to convey the atmosphere of the event in words. It is said, a picture is worth a thousand words and here is a selection to give you some idea of this fantastic bootcamp. You can see more pictures from the event here and here.

The round authors are Endagorion, ifsmirnov, zemen and Arterm. The round is combined for both divisions, will contain seven problems and last for three hours. Good luck!

UPD: The scoring is 500-1000-1250-2000-2500-3250-3500.

The contest is finished. We hope that you enjoyed it. Congratulations to the winners!

• Merkurev
• Radewoosh
• 666sb666
• V--o_o--V
• Shik
• Belonogov
• tomasz.kociumaka
• darry140
• subscriber
• jiaqiyang

Problem author: KAN.

Problem author: KAN.

Problem author: pashka.

Problem author: pashka.

Problem author: sivukhin.

Problem author: Endagorion.

Problem author: Um_nik.

Problem author: Um_nik.

Hi all,

The 8VC Venture Cup 2017 - Final Round is tommorrow at 18:05 UTC. Along with that, Codeforces Round #393 will be held at the same time both for Div. 1 and Div. 2 participants. The Div. 1 Edition will contain the same problems as the Final Round, the Div. 2 Edition will be easier.

Of course, those who have placed in top 200 in 8VC Venture Cup 2017 - Elimination Round should register for the Final Round, all the others should register for Div. 1 or Div. 2 editions according to their rating. All three contests will contain six problems, last two hours and be rated.

The problem authors are Um_nik, Endagorion, sivukhin, pashka and me. Also huge thanks to fcspartakm for his help in preparation, and to vepifanov and AlexFetisov for testing the round. I suggest you reading all the problems to find which one you like the most!

I'd like to remind you about the prizes:

• Overall 1st place — $2000
• Overall 2nd place — $1000
• Overall 3rd-5th places — $500 each
• Overall 1-50th place — t-shirts with 8VC and company logos
• Local Winner — Dinner with Joe Lonsdale (founder of Palantir, Addepar and 8VC) and other Silicon Valley technologists
• Local top finishers — Opportunity to meet with leadership from 8VC portfolio companies

Please welcome one more company became interested in the Venture Cup, Progressly!

Progressly is a cloud-based Operational Performance Management platform allows you to document, collaborate on, and gain contextual insights into core business processes and outcomes in real time.

The scoring is usual in all three contests: 500-1000-1500-2000-2500-3000.

Congratulations to the winners!

8VC Vecture Cup 2017 winners:

1. V--o_o--V
2. bmerry
3. Marcin_smu
4. LHiC
5. qwerty787788

Codeforces Round #393 Div. 1 winners:

1. HYPERHYPERHYPERCUBELOVER
2. RomaWhite
3. PavelKunyavskiy
4. snuke
5. vintage_Vlad_Makeev

Codeforces Round #393 Div. 2 winners:

1. Kacey
2. wcx5tq957i
3. BekzhanKassenov
4. Tailz
5. BitHashTech

Editorial