Pagini recente » Cod sursa (job #484071) | Monitorul de evaluare | Rating Micodan Vladut (vladdutt) | Cod sursa (job #48892) | Cod sursa (job #27095)
Cod sursa(job #27095)
#include <fstream.h>
unsigned long a[500000],i,n,sum=0;
int main()
{
int k;
ifstream f("pascal.in");
ofstream g("pascal.out");
f>>n>>k;
a[1]=1;
for (i=2;i<=n;i++)
a[i]=a[i-1]*i;
for (i=1;i<=n/2;i++)
if ((a[n]/(a[i]*a[n-i]))%k==0)
sum++;
sum=sum*2;
if (n%2==0 && a[n/2]*a[n/2]%k==0)
sum--;
g<<sum<<"\n";
f.close();
g.close();
return 0;
}