Привет, Codeforces!
Команда ТГ канала @KogutIvanTutoring рада позвать вас принять участие в Codeforces Round 1043 (Div. 3) во 21.08.2025 17:35 (Московское время) — очередной Codeforces раунд для третьего дивизиона. В этом раунде будет 6-8 задач, которые подобраны по сложности так, чтобы составить интересное соревнование для участников с рейтингами до 1600. Однако все желающие, чей рейтинг 1600 и выше могут зарегистрироваться на раунд вне конкурса.
Раунд пройдет по правилам образовательных раундов. Таким образом, во время раунда задачи будут тестироваться на предварительных тестах, а после раунда будет 12-ти часовая фаза открытых взломов, после её завершения все успешные попытки будут перетестированы на успешных взломах. Мы постарались сделать приличные тесты — так же как и вы, мы будем расстроены, если у многих будут падать решения после окончания контеста.
Вам будет предложено 6-8 задач и 2 часа 15 минут на их решение.
Штраф за неверную попытку в этом раунде будет равняться 10 минутам.
Напоминаем, что в таблицу официальных результатов попадут только достоверные участники третьего дивизиона. Как написано по ссылке — это вынужденная мера для борьбы с неспортивным поведением. Для квалификации в качестве достоверного участника третьего дивизиона надо:
- принять участие не менее чем в пяти рейтинговых раундах (и решить в каждом из них хотя бы одну задачу)
- не иметь в рейтинге точку 1900 или выше.
Независимо от того являетесь вы достоверными участниками третьего дивизиона или нет, если ваш рейтинг менее 1600, то раунд для вас будет рейтинговым.
Задачи были придуманы и подготовлены частью нашей команды: fstilus, EzikBro, KotlechkovEgor, Wileyne, Friendiks, Boodoochai, pskobx
Также большое спасибо:
MikeMirzayanov за системы Polygon и Codeforces.
Vladosiya за координацию раунда.
a.stepanov281005, AC_sahER, Proof_by_QED, cry, fangcy за оранжевое тестирование раунда.
_IVON_, Gmacem, Escapisst, macaquedev, ego_death за фиолетовое тестирование раунда.
EnigmaEon, margothequeen, semwin2008, Yassia, Pistol_Engineer, EduardoBrito, radodododo, Onomui за синее тестирование раунда.
Art10em, MrYhatoh, dragoonSlayer за бирюзовое тестирование раунда.
mlovbnee за серое тестирование раунда.
Всем удачи!
UPD. Разбор выложен!









Good luck to everyone, there's no FSTs in this contest!
yo guys, can you help me back to positive contribution?
for sure, mister. it is a pleasure to help u with my 5 codeforces accounts.
hope this is the last div.3 i officially participate in
I just want +ve delta 🥲
edit: why am i getting downvoted???
Hello, I participate for the first time in a competition , I didn't even know codeforces existed before today and I look forward to compete. Thanks, good luck to all.
There will officialy be Silksong news 5 minutes before the round. That'll either give me the boost straight for specialist, or make me want to kill myself. Let's hope it's the former.
i wish for the boost.
I am looking forward to this game very much
I hope it'll be good contest for everyone and I'll get a huge + delta.
I will compete for being expert, I hope I do well and enjoy this round.
Hoping to leave pupil this time
Clashes with Silksong special announcement
:)
Vladosiya, cry, Proof_by_QED here?
I have to participate!
Finally , CF is back to ruin my day again :)
Finally , CF is back to ruin my day again :)
What a great contest!! Thanks to authours!!
Wishing high ratings to everyone!!
19k solves in B? CF is cooked.
this is div3 dummy there always are that many submissions
MathForces
Was hard as Div2
C2 was tough, but such an amazing problem!
C2 almost killed me..........
How did it went guys?
For me since I am a newbie I wasted all the time on 1st two problems.
same, except I made a retarded mistake in secound problem.
I forgot to print how many x are here. idk why I took me hour to figure out
Shit it must've been frustrating.
oh it was really frustrating.
I forgot to respond
Hahaa it's okiee :)
digitforces
true bro
How to solve D?
Can anyone please explain the approach??
dp
Are you referring to digit DP??
nope something similar to decomposition
Yeah, but what about using prefix sums tto compute till the kth digit, that we can easily find out using basic maths? run a while loop and keep multiplying 9*10 power number to identify the location oif the digit?
same idea but rather than looping i thought to decompose using recursion kinda dp'ish approach with precalc range result and all
Very very great contest! Just a little bit harder than its name
Also I was ranked 800 until 25 minutes before the end and now I see I'm 1900! How is that possible?
ChatGPT gives D's answer in seconds
so bad contest as Div3 contest. i show that it was should be rated as Div2.
no way div2 is way harder for ABCs
nice problems, felt very similar to previous div 3s only, didnt try D and C2 but got the logic and will upsolve
I don’t like pD It’s so annoying
ikr
Guys!! I have attended in a math olympiad for the first time in my life. Thanks for the Contest !!
F and G are entirely cobbled together by forcing multiple different templates. It's really extremely boring to set such questions.
I got negative delta on this contest because while doing one of the problems, I saw a picture of the newly revealed mega victreebel (pic below) and could not properly debug my code while laughing for 45 minutes.
d is way too standard and solvable with the following 2 links with very little modification
https://www.geeksforgeeks.org/competitive-programming/cses-solutions-digit-queries/
https://stackoverflow.com/questions/73821319/number-of-occurrences-of-digit-in-numbers-from-0-to-n
Something like digit DP seems to be too complicate for a problem D. Do you have any simple solution?
My god, problem $$$D$$$ is implementation hell. I got the idea quickly of binary search and we can use Digit DP to find sum of digits of numbers in a range, but was not able to complete the implementation in time :(
problem D is awful
I'm trying to solve D and going as far as:
But to figured what is the exact sum with k is some number is still doesn't quite there yet, can someone teach me how to approach similar problem more efficiently?
You first need to see how many numbers this sequence has For example, you can start by subtracting 9 from k, then 90*2=180, then 900*3=2700, etc., and finally, with a little attention to detail, you get the number of numbers After that, you can easily solve it (you can search for the sum of the digits of numbers 1 to n on Google) Also, the last number, which only needs to be calculated for some of its digits, must be calculated separately
ah right I forgot with what I have is the number digit of n, so at that point I can figured the digit = number of cycles count...
I just suck at digit DP stuff
div3 or div2 + div 3?
div3 or div2 + div3?
2.5
Cheers to ChatGPT!!
Does anyone know more problems like D (ignoring cses)
1177A - Digits Sequence (Easy Edition)
1177B - Digits Sequence (Hard Edition)
1216E1 - Numerical Sequence (easy version)
1216E2 - Numerical Sequence (hard version)
1373E - Sum of Digits
Hope you find them useful.
C1 was easier than B. C2 was a really good problem.
I think most of the downvotes on this blog are because of the math heavy problems from B to D.
YAY
MY PRAYER HAS BEEEEN A/C
Almost every newbie, pupil, specialist of top 100-200 have one or more than one AI code. Why CF are not banning them, why only skip their solution. If a person cheat this time, and you only skip his solution, next time he will make sure that his code looks like more human written.
And I do not understand the mindset of these Indian college students. Every where I see most of them are Indian engineering students. Bro, you might get a job by cheating, but you won't survive in the culture. Every day companies are laying off people, you might get one job easily by cheating, but for other job you will struggle a lot. Even some companies are moving to in-person interviews because of cheating. Stop doing cheating, and start studying.
Why are the ranks shown in friend and common standings different ?
Dudes were too lazy to make a contest, so they just gave us a math exam instead.
In C1
why this code is calculating the cost for each 3^x correctly? The formula was
3^(x+1) + x * 3^(x-1)but we aren't using this. For more please see editorial.Here is the proof, hope it help (you have to do tricks such as add 0 and multiply by 1)
How does the standing system work? It shows that my official common standing is 3372 yet in the contest section in my profile, my rank is displayed to be 4517.
The official standings only contain trusted participants (who participated in 5+ rated rounds). For rating calculation, every participant whose rating is below 1600 is considered, regardless of trusted or not. The rank shown in your profile page is the position among the latter set of people.
Dear Codeforces Team,
I am writing to respond to the notice about my solution (ID: 334878052) being similar to others. I want to clearly say that I did not cheat and did not share my code with anyone.
I created the solution by myself. I first thought through the main ideas on paper and made sure they were correct before writing any code. For testing, I used an online compiler (GeeksforGeeks compiler and some time other online IDE also), which I have done before in past contests. Now I understand that using such websites might make my code visible to others, which could explain the similarities. I feel really sorry about this mistake.
I want to make it clear that I never meant to break the rules. From now on, I will only use my local computer for writing and testing code to avoid any such issues in the future.
I apologize if this situation has worried anyone, and I hope you can consider my explanation. I care a lot about the fairness of competitive programming and the Codeforces community. I am committed to following the rules and maintaining the standards of this platform.
Respectfully, abhi00100 2132E - Соревнование по арифметике Codeforces Round 519 by Botan Investments
Got a TLE on the 4th problem with only 7 minutes left. Replaced a nested while loop with an O(1) arithmetic trick and got #Accepted just 3 minutes before the final whistle. Siuuu... #Codeforces