Pagini recente » Cod sursa (job #2628096) | Cod sursa (job #1890161) | Cod sursa (job #1340551) | Cod sursa (job #2439291) | Cod sursa (job #215444)
Cod sursa(job #215444)
#include<fstream.h>
long d,r,nr,c,i;
int p[29900];
long put(long p,long n)
{long f=0;
while(p<=n)
{f+=n/p;
p*=p;
}
return f;
}
int main()
{ifstream fin("pascal.in");
fin>>r>>d;
fin.close();
ofstream fout("pascal.out");
if(d!=4&&d!=6)
{for(i=1;i<=r;i++)
p[i]=put(d,i);
nr=0;
for(c=1;c<=r/2;c++)
{if(p[r]-p[r-c]-p[c]>=1)
nr++;
}
nr*=2;
if(r%2==0)
nr--;
fout<<nr<<'\n';
}
else
if(d==4)
{d=2;
for(i=1;i<=r;i++)
p[i]=put(d,i);
nr=0;
for(c=1;c<=r/2;c++)
{if(p[r]-p[r-c]-p[c]>=2)
nr++;
}
nr*=2;
if(r%2==0)
nr--;
fout<<nr<<'\n';
}
fout.close();
return 0;
}