MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / main

Function main

CodeChef_problems/Enormous Input Test/solution.cpp:5–18  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

3using namespace std;
4
5int main()
6{
7 unsigned int n, divisor, dividend;
8 int count = 0;
9
10 cin >> n >> divisor;
11 for(int i = 0; i < n; i++)
12 {
13 cin >> dividend; //input k each iteration
14 if(dividend % divisor == 0) //check if it is divisible
15 count++; //output
16 }
17 cout << count;
18}

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected