Pagini recente » Cod sursa (job #2254906) | Cod sursa (job #40772) | Cod sursa (job #1446271) | Cod sursa (job #2939739) | Cod sursa (job #1184440)
#include <cstdio>
using namespace std;
int fact(int n,int d)
{
int cd=d,ras=0,put=1,cn=n;
while(cd<=n)
{
while(cn>1)
{
ras=ras+1;
cn=cn/cd;
}
cn=n;
cd=cd*d;
}
return ras;
}
int main()
{
FILE *in,*out;
in=fopen("pascal.in","r");
out=fopen("pascal.out","w");
int n,i,j,d,r,facti,factj,ras=0,factdif;
fscanf(in,"%d%d",&r,&d);
facti=fact(r,d);
for(i=0;i<=(r+1)/2;i++)
{
factj=fact(i,d);
factdif=fact(r-i,d);
if(facti-factj-factdif>=1)
ras++;
}
if((r+1)%2==1)
fprintf(out,"%d",ras*2-1);
else
fprintf(out,"%d",ras*2);
return 0;
}