OJ Board

Thanks a lot guys! I got AC now.

Ok. Thanks for your help.
I did not describe idea, because I thought it's pretty simple.
I've used the definition of a factorial.
I check numbers from m to n with step m. And calculate number of dividers equal m (a power of m). Then I add these numbers. Resulting sum is the largest power of m.

It ...

Why WA?

[c]#include <stdio.h>

int getDevidersNumber(int a, int b)
{
int i = 0;
while (0 == (a % b)) {
a = a / b;
i++;
}
return i;
}

int main(void)
{
int i, j, N, m, n, pow;
scanf("%d", &N);
for (i = 1; i <= N; i++) {
scanf("%d %d", &m, &n);
printf("Case %d:\n", i);
if (n == 1 ...