You are given a street of length n, where n is even. Each block on the street can hold one car.
In one move, you can move a car either forwards or backwards, as long as there is no car in the square to the left or to the right of the car.
There are n/2 total cars on the street, and your goal is to get the cars to be evenly spaced — meaning, there is exactly one open square between any two adjacent cars.
Full Problem Description, Submission Portal, and Leaderboard
The level is for Div 3 / Div 2 participants. Would encourage you all to try the question and see if you can make it onto the leaderboard :)
It's a great initiative . Hope it will help to build logic before starting programming in a small age.
Can you check part-5 input file ($$$n = 10^7$$$) link? It says "File is in owner's trash".
Oh sorry, will fix! It is the same as the file for part 3 :)
fixed!