At the lantern reef of Glowtide, Kabir records each tickets in a worn leather ledger. The guild wants answers, not guesses. Task: Read n integers and a divisor d; print how many elements are divisible by d. Input format: First line: n and d. Second line: n space-separated integers. Output format: Print the count of elements divisible by d. Constraints: 1 <= n <= 52; -100 <= a[i] <= 10; 1 <= d <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 52; -100 <= a[i] <= 10; 1 <= d <= 1000.
