Enormous Input Test Codechef Solution

by

Enormous Input Test Codechef Solution

Problem

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

Enormous Input Test – CodeChef Solution in Python

N, K = map(int, input().split())
count = 0
while N > 0:
    a = int(input())
    if (a % K == 0):
        count += 1
    else:
        0
    N = N - 1
print(count)

Enormous Input Test  – CodeChef Solution in CPP

#include <iostream>
#include <cstdio>
using namespace std;
int main() {
 // your code goes here
 int a, b, c, d=0;
 scanf("%d %d", &a, &b);
 while (a--) {
  scanf("%d", &c);
  if(c%b==0) d++;
 }
 printf("%d", d);
 return 0;
}

Enormous Input Test – CodeChef Solution in JAVA

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int result = 0;
		for (int i = 0; i < n; i++) {
			int t = sc.nextInt();
			if (t % k == 0) {
				result++;
			}
		}
		System.out.println(result);
		sc.close();
	}
}

Disclaimer: The above Problem (Enormous Input Test) is generated by  CodeChef but the solution is provided by Chase2learn.This tutorial is only for Educational and Learning purpose.

Leave a Comment