Factors
CodeChefOpen on judge ↗
M1 and M2 are 2 people fascinated by mathematics. M1 is always challenging M2 and comes up to him very excitedly. He says to M2: "Could you find the number of unique numbers a product of N numbers is divisible by ?" and hands him a sheet very expectedly. M2 is usually great at meeting M1's mark but he feels sick that day and calls you to ask for help for the problem M1 has given him. Could you hel
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