Enormous Input Test
You are given $N$ integers. Find the count of numbers divisible by $K$. ### Input The input begins with two positive integers $N$, $K$. The next $N$ lines contains one positive integer each denoted by $A_i$. ### Output Output a single number denoting how many integers are divisible by $K$. ### Constraints - $1 \leq N, K \leq 10^7$ - $1 \leq A_i \leq 10^9$ ### Sample Test Cases **Sample 1** Inp
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