Pagini recente » Cod sursa (job #14094) | Cod sursa (job #2535494) | Cod sursa (job #2589387) | Cod sursa (job #1538765) | Cod sursa (job #35739)
Cod sursa(job #35739)
// Problema Zero 2
#include <stdio.h>
int main()
{
freopen( "zero2.out", "wt", stdout );
long int N, B, fac, k, i, j, nr;
long int a[1000];
int nrd;
freopen( "zero2.in" ,"rt", stdin );
for ( i=1; i<=10; i++ )
{
scanf( "%ld %ld", &N, &B );
nrd = 0;
for( j=2; j*j<=N*B; j++ )
if( ( (N*B)%j == 0 ) && ( j < N ) && ( j < B ) )
a[++nrd] = j;
a[nrd+1] = 0;
nr = 0;
for( k=1; k<=N; k++ )
{
fac = k;
while( fac%B == 0 )
{
nr += N-k+1;
fac = fac/B;
}
for( j=1; j<=nrd; j++ )
if( k == a[j] )
{
nr++;
break;
}
}
printf( "%ld\n", nr );
}
fclose( stdin );
fclose( stdout );
return 0;
}