# Enormous Input Test: INTEST

## Enormous Input Test CodeChef Solution

Public Submission link: Click here (anyone can submit here )

CU Submission link: Click here (need login by CU account)

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<=10^{7}). The next n lines of input contain one positive integer t_{i}, not greater than 10^{9}, each.

### Output

Write a single integer to output, denoting how many integers t_{i} are divisible by k.

### Sample Input 1

```
7 3
1
51
966369
7
9
999996
11
```

### Sample Output 1

```
4
```

### Explanation

The integers divisible by 33 are 51,966369,9,51,966369,9, and 999996999996. Thus, there are 44 integers in total.

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<=10^{7}). The next n lines of input contain one positive integer t_{i}, not greater than 10^{9}, each.

### Output

Write a single integer to output, denoting how many integers t_{i} are divisible by k.

### Sample Input 1

```
7 3
1
51
966369
7
9
999996
11
```

### Sample Output 1

```
4
```

### Explanation

The integers divisible by 33 are 51,966369,9,51,966369,9, and 999996999996. Thus, there are 44 integers in total.

## Enormous Input Test CodeChef Solution in C++ 17

```
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin >> n >> k;
int count=0;
for (int i=0;i <=n-1;i++)
{
int a;
cin >> a;
if (a%k==0)
{
count++;
}
}
cout << count << endl;
return 0;
}
```

## Enormous Input Test CodeChef Solution in Python 3

```
# We have populated the solutions for the 10 easiest problems for your support.
# Click on the SUBMIT button to make a submission to this problem.
#Note that it's python3 Code. Here, we are using input() instead of raw_input().
#You can check on your local machine the version of python by typing "python --version" in the terminal.
(n, k) = map(int, input().split(' '))
ans = 0
for i in range(n):
x = int(input())
if x % k == 0:
ans += 1
print(ans)
```

## Enormous Input Test CodeChef Solution in Java

```
// We have populated the solutions for the 10 easiest problems for your support.
// Click on the SUBMIT button to make a submission to this problem.
// www.progies.in
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
// Remember that the class name should be "Main" and should be "public".
public class Main {
public static void main(String[] args) {
// System.in and System.out are input and output streams, respectively.
InputStream inputStream = System.in;
InputReader in = new InputReader(inputStream);
int n = in.nextInt();
int k = in.nextInt();
int ans = 0;
for (int i = 0; i < n; i++) {
int x = in.nextInt();
if (x % k == 0) {
ans++;
}
}
System.out.println(ans);
}
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
```

More Codechef Solution: Click Here

Enormous Input Test CodeChef Solution

The content uploaded on this website is for reference purposes only. Please do it yourself first. |