#include <stdio.h>
#include <math.h>
int main ()
{
int number;
while ( scanf ("%d", &number) != EOF ) {
if ( number == 0 )
return 0;
int save = number;
int count = 0;
if ( floor ( sqrt (number) ) == sqrt (number) )
count--;
int i;
for ( i = 2; i <= sqrt (number) + 1; i++ ) {
int flag = 0;
while ( number % i == 0 ) {
number /= i;
flag = 1;
}
if ( flag == 1 )
count++;
}
printf("%d : %d\n", save, count+1);
}
return 0;
}
This entry was posted on July 6, 2009 at 1:12 am and is filed under ACM (UVa) Algorithm with tags ACM (UVa) : VOL : CVI, Algorithm, Source Code. You can follow any responses to this entry through the RSS 2.0 feed
You can leave a response, or trackback from your own site.