STARKS Prime Factors

CodeChefOpen on judge ↗

Mr. Stark loves primes and created queries where each query takes the form of an integer, . For each , he wants you to count the maximum number of unique prime factors of any number in the inclusive range and then print this value on a new line. Note: Recall that a prime number is only divisible by 1 and itself, and 1 is not a prime number. ###Input: - The first line contains an integer,q, denot

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