In the opal reefs of Shimmerdeep, Quartermaster the cartographer keeps careful count of the readings. win the guild's seasonal contest, every figure matters. 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 <= 67; -1000000 <= a[i] <= 1000000; 1 <= d <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 67; -1000000 <= a[i] <= 1000000; 1 <= d <= 1000.
