Pagini recente » Cod sursa (job #2476425) | Cod sursa (job #2961812) | Cod sursa (job #1821305) | Cod sursa (job #2679362) | Cod sursa (job #2911695)
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
int nr,d,n;
long long int a[5000001][5000001];
int main()
{
fin>>n>>d;
for(int i=1;i<=n+1;i++)
{
for(int j=1;j<=n+1;j++)
{
if(j==1 || i==j)
{
a[i][j]=1;
}
else
{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
//fout<<a[i][j]<<" ";
}
//fout<<"\n";
}
for(int j=1;j<=n+1;j++)
{
if(a[n+1][j]%d==0)
{
nr++;
}
}
fout<<nr;
return 0;
}