Enormous Input Test | Codechef solution

Problem (Enormous Input Test | Codechef solution):-

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 of Enormous Input Test | Codechef solution

The input begins with two positive integers n k (n, k<=10⁷). The next n lines of input contain one positive integer t_i, not greater than 10⁹, each.

Output of Enormous Input Test | Codechef solution

Write a single integer to output, denoting how many integers t_i are divisible by k.

Example

Input:
7 3
1
51
966369
7
9
999996
11

Output:
4

Code:-

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,t;
    cin>>n>>k;
    int count=0;
    while(n--)
    {
      cin>>t;
      if(t%k==0)
         count++;
    }
    cout<<count;
    return 0;
}

 

Recommended Post:-

 

• Primary test
• Sum or difference
• point and line

 

Wipro :-

 

• Update the booking ID | Wipro previous year question paper solution
• Pages in PDF
• Find the location id
• Find the odd digits
• Find the Product ID

 

Infytq :-

 

• Matrix sum | Infytq solution
• Counting frequency of the character by using map function

 

Key Points;-

Hackerrank:-

C-tutorial:-

 

• Micros in C
• Pointer in c
• Function declaration
• Types of user define function
• return type of function
• 2D array

See more:-

 

• c program to convert specified days into years weeks and days
  
• Print Reverse Hollow Pyramid
• Update the booking ID | Wipro previous year question paper
• Pages in PDF | Wipro previous year question paper
• Sparse Matrix in data structure
• Find the location ID | Wipro previous year Coding question
• find the odd digits | Wipro Coding question
• Find the product id | Wipro Coding question
• Difference between static and dynamic memory allocation
• What is asymptotic Notation