Pagini recente » Cod sursa (job #557320) | Cod sursa (job #2669682) | Cod sursa (job #2162241) | Cod sursa (job #2047201) | Cod sursa (job #25376)
Cod sursa(job #25376)
#include<stdio.h>
FILE *f=fopen("zero2.in","r");
FILE *g=fopen("zero2.out","w");
long n,b,i,j,a[25],e[10],z,t,c[10],d[10];
void read()
{
for(i=1;i<=25;i++)
a[i]=1;
for(z=0;z<10;z++)
{
fscanf(f,"%d",&n);
fscanf(f,"%d",&b);
int v=1;
for(i=0;i<10;i++)
c[i]=i;
for(i=1;i<=n;i++)
{
a[i]=1;
for(int j=1;j<=i;j++)
a[i]=a[i]*c[j];
d[v]=a[i];
v++;
}
long aux=1;
aux=1;
e[z]=0;
for(i=1;i<=n;i++)
aux=aux*d[i];
do
{
if(aux%b==0) e[z]++;
else break;
aux=aux/b;
}
while(aux!=0);
}
}
/*void calc()
{
int v=1;
for(i=0;i<10;i++)
c[i]=i;
for(z=0;z<10;z++)
{
for(i=1;i<=n[z];i++)
{
a[i]=1;
for(int j=1;j<=i;j++)
a[i]=a[i]*c[j];
d[v]=a[i];
v++;
}
}
int h=v-1;
long aux=1;
for(z=0;z<10;z++)
{
aux=1;
e[z]=0;
for(i=1;i<=n[z];i++)
aux=aux*d[i];
do
{
if(aux%b[z]==0) e[z]++;
aux=aux/b[z];
}
while(aux!=0);
}
}*/
void write()
{
for(z=0;z<10;z++)
fprintf(g,"%d\n",e[z]);
}
int main()
{
read();
/*calc();*/
write();
fcloseall();
return 0;
}