Aman and Divisors

CodeChefOpen on judge ↗

Aman is good at solving problems. But his friend Bunty thinks he is better than Aman. Now Bunty has a challenge that he thinks Aman won't be able to solve. Bunty gives $2$ numbers, $N$ and $Q$ to Aman and asks him to calculate the number of divisors of $N$ which are divisible by $Q$. You need to help Aman to prove himself infront of Bunty by printing the required answer to the challenge. ###Inpu

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