We invite you to participate in the boot camp that will be held at Yanka Kupala Grodno State University in collaboration with Moscow ACM ICPC Workshops from 15 to 25 August, 2017.
The main purpose of the camp is to prepare student teams that participate in ACM ICPC season 2017/2018 to successful performance in this competition. There will be two division. Division B is designed for participants of the ACM ICPC Regionals level and above. The official language of Division B is English. Another division is Division C, which is designed for newcomers to the world of competitive programming. The official language of Division C is Russian. The curriculum of both divisions features contests, analyses and thematic lectures. The part of lectures will be for both divisions, also there will be thematic separate lectures for Division B and Division C.
The cost of participation per single person is: 490 USD.
The cost features the curriculum, food and accommodation at the Grodno State University campus and trip schedule on days-off.
Grodno State University, being located almost in the center of Europe, is one of the centers for ACM ICPC coaching. Among the events hosted at GrSU are: bootcamps and open competitive programming championships.
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 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!
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.
This Sunday July 2, 19:05 MSK rated Codeforces Round #422 (Div. 2) will be held.
This time I'm the only one author in contradistinction to the Round 415. Many thanks to coordinator Alex netman Vistyazh for help in preparations of the round, Vladislav winger Isenbaev, Alex AlexFetisov Fetisov, Nikolay KAN Kalinin and Ildar 300iq Gainullin for testing the problems and also to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon platforms.
As in the Round 415, the main characters of the tasks will be the stunning girl Noora and hacker Leha.
Participants will be given six problems and two hours to solve them. As always, participants from the first division can take part out of competition. Scoring will be announced before the round.
I hope you'll enjoy my round. I wish everyone good luck and high rating!
UPD1: Note that the number of tasks which would be proposed for the solution has been changed.
UPD2: The scoring for this round is: 500 — 750 — 1250 — 1750 — 2250 — 2500.
UPD3: Congratulations to the winners! Editorial will be posted soon.
The round will be unrated for all users and will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally.
You will be given 7 problems and 2 hours 15 minutes to solve them.
The problems were prepared by Mikhail awoo Piklyaev, Alexey Perforator Ripinen and me.
Nowadays machine learning technologies are widely used in practice in various applied fields such as retail, mass media, PR and marketing, banking, telecommunications, manufacturing, science and many other areas.
We are pleased to announce our Industrial Machine Learning course, aimed to teach the structure and the life cycle of the machine learning process and covers topics ranging from the problem statement to final quality assessment as well as estimation of the economic effect.
This course is taught by two Data Scientists from Yandex, Emeli Dral and Victor Kantor. Emeli Dral is the Head of Predictive Analysis, whereas Victor Kantor is the Head of User Behaviour Analysis Group at Yandex.
They share with us their knowledge on everything from the most promising applications of data science today to applying the latest advancements in machine learning to your work.
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.
It's the round you've been waiting for... Codeforces Round #420 (Div 2). It will take place tomorrow, 25 June 2017, at 17:35 MSK. As always, Div. 1 participants are encouraged to join out of competition. The round will be rated for Div. 2 participants and will have 5 problems to be completed in 2 hours.
I wouldn't be able to create this round without the help of many people: KAN for lots of help in preparing the contest, 300iq and Alladdin for testing and providing feedback, and as always MikeMirzayanov for the Codeforces and Polygon platforms.
This will be my second contest, and I'm glad to get such a nice round number :). Hopefully, you'll find the problems interesting. Of course, you should read all the problems so you can solve problems you find easy or interesting.
To excite some and disappoint others, the round theme will have nothing to do with the number 420. Instead, continuing the anime themes of the last two rounds, round #420 will feature mad scientist Rintaro Okabe (don't read spoilers!) from the anime Steins;Gate. Statements will not contain any spoilers, but you might find the problems slightly more amusing if you've watched the series. Of course, you should watch the series if you havent :)!
As per Codeforces tradition, scoring distribution will be announced shortly before the contest. Good luck, and I hope you can help Okabe with all 5 tasks :D!
I really apologize for the issues during the round. It's upset a lot of people and I should have taken more care. Hopefully you won't hold this against Okabe or Steins;Gate anime :P
I am honored to announce Codeforces Round #419. It will take place tomorrow, on June 17, 17:35 MSK.
The problems in this round are written by me, robinyu. I believe it is the first Codeforces round with a Philippine writer. I would like to extend my heartfelt gratitude to kevinsogo, AlexFetisov and winger for their invaluable help in testing the problems, KAN for his endless patience and support in preparing the contest, and of course MikeMirzayanov for the absolutely amazing Codeforces and Polygon platforms.
In this round, you will be helping Karen in her day-to-day routine.
There will be pretty pictures, drawn by the lovely Kazenokaze. Do not miss the round!
Both divisions will be given five problems and will have two hours to solve them. Keeping with authentic Codeforces tradition, scoring will be announced right before the round.
As a matter of course, you are highly recommended to read all the problems; though problems are arranged by expected difficulty, you may find some problems easier than others.
I hope you will enjoy the problems as much as I did writing them!
