HDU_1492 The number of divisors(约数) about Humble Numbers

#include <stdio.h>

__int64 search(__int64 n, __int64 m)
{
__int64 sum = 0;
while (n != 1)
{
if (n % m == 0)
{
sum ++;
n /= m;
}
else     break;
}
return sum;
}

int main()
{
__int64 n, a, b, c, d, sum;
while (scanf("%I64d", &n) && n)
{
a = b = c = d = 1;
a += search(n, 2);
b += search(n, 3);
c += search(n, 5);
d += search(n, 7);
sum = a*b*c*d;
printf("%I64d\n", sum);
}
return 0;
}