PLAMBAR
CodeChefOpen on judge ↗
Palambar has created a mess while prime factoring numbers. He needs your help to find the largest prime factor of a given number.. Input First line contains T the number of test cases Each test case contains a single number N whose largest prime factor needs to be found. Sample Input: 2 2 3 Output Corresponding to every input, output a single number which is the required number. Sampl
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.
Sign in to chat with the tutor and save your progress.
Sign in to start