← All problemsSign in

Prime Lover

There is a farm containing trees numbered from $1$ to $N$. The owner of the farm believes in god, so he thinks that a tree can only be cut down if it's height is a **Prime number**. The height of the trees increase by $1$ unit every day. So every day he goes to the farm and starts cutting trees whose height is a prime number. If there are multiple such trees in a day, he cuts them down in increasi

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