-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIntest
More file actions
25 lines (20 loc) · 646 Bytes
/
Intest
File metadata and controls
25 lines (20 loc) · 646 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
Name - Enormous Input Test
Problem Code - INTEST
Problem Statement -
The purpose of this problem is to verify whether the method you are using to read input data is sufficiently fast to handle problems branded with the enormous Input/Output warning. You are expected to be able to process at least 2.5MB of input data per second at runtime.
Input
The input begins with two positive integers n k (n, k<=107). The next n lines of input contain one positive integer ti, not greater than 109, each.
Output
Write a single integer to output, denoting how many integers ti are divisible by k.
Example
Input:
7 3
1
51
966369
7
9
999996
11
Output:
4