This content originally appeared on DEV Community and was authored by JaeHonity
https://www.acmicpc.net/problem/2869
In the beginning, I thought it's so simple test because one while loop can solve it.
But after I failure the test cases, I check one more time and they want "0.25" second of optimization.
Spoiler
I found the math logic.
each day, Snail climbs up and fell down, but other way, Snail is fell down and climb up.
So there's this logic is available.
n = days
-fall * (n - 1) + climb * n >= max
-fall * n + fall + climb * n >= max
-fall * n + climb * n >= max - fall
(climb-fall) * n >= max - fall
n = (max - fall) / (climb - fall)
and without loop, just one time of calculation is solving the problem!
This content originally appeared on DEV Community and was authored by JaeHonity
JaeHonity | Sciencx (2025-07-02T05:44:22+00:00) Coding Test – Snail wants to climb. Retrieved from https://www.scien.cx/2025/07/02/coding-test-snail-wants-to-climb/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.