Prime Factorisation

CodeChefOpen on judge ↗

Problem Statement You are provided with an integer N. You need to calculate the number of distinct prime factors of the number N. Input section The first line contains an integer, T, denoting the number of test cases. Next T lines each contain an integer N. Output section For each test case, print the number of distinct prime factors of N in a new line. Input constraints 1 ≤ T ≤ 10 1 ≤ N ≤

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