Wrong anti-spam code

Formulation

You can assume that the function maxExponent is properly implemented. Its arguments are two positive integers x and b, such that b>1. The function returns the largest exponent \(\alpha\) such that \(b^{\alpha}\) is a divisor of x.

Create the implementation of the function numZeroes that has three arguments: aS of type long*, n of type long, and m of type long. The variable aS contains the address of the first element of the sequence s[0], s[1], ..., s[n-1] of positive integers. The function has to return the number of zeroes at the end of the integer P that is obtained as a product of all those elements of s that are bigger than m. Your code should replace the text // ??? // below.

long numZeroes(long* aS, long n, long m){ 
   // ??? //
}

Your submission


Picture
Prove that you are not a robot.