Create a function foo() that takes an unsigned int array and an unsigned int
number N as arguments. It returns the size of the largest sub-array whose s
um of its elements is a multiple of N. The array has less than 10000 element
s and N is less than 1000. This function should be as fast as possible
