C
Hey guys I need help with writing a program. I need to make a program that finds the integer from 1 to 1000 with the most divisors that produce no remainder. For example, the integer 60 has 12 divisors that produce no remainder.
They are 1,2,3,4,5,6,10,12,15,20,30,60.
Can anyone help? Thanks in advance!
They are 1,2,3,4,5,6,10,12,15,20,30,60.
Can anyone help? Thanks in advance!