← All problemsSign in

Closest Power

CodeChefRating 2860Open on judge ↗

An integer $x$ is said to be a **Perfect Power** if there exists **positive** integers $a$ and $b$ (i.e $a$, and $b$ should be $\geq 1$) such that $x = a^{b+1}$. Given an integer $n$, find the closest Perfect Power to $n$. If there are multiple *Perfect Powers* equidistant from $n$ and as close as possible to $n$, find the smallest one. More formally, find the smallest integer $x$ such that $x$

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start