Prime Factor

CodeChefOpen on judge ↗

You start with a sequence of consecutive integers. You want to group them into sets. You are given the interval, and an integer P. Initially, each number in the interval is in its own set. Then you consider each pair of integers in the interval. If the two integers share a prime factor which is at least P, then you merge the two sets to which the two integers belong. How many different sets the

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