← All problemsSign in

Prime Wreck

Wrecking is a process of destruction. But if one wish to wreck an integer they must know the smallest and the largest prime factor of that number For example if one wishes to wreck 100(whose prime factors are 2 x 2 x 5 x 5) one should  know 2,5 as smallest and largest prime factors of 100 now your task is to write a program which can wreck the numbers. Input - The first line of the input contain

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