Cod sursa(job #1812986)
Utilizator | Data | 22 noiembrie 2016 16:50:10 | |
---|---|---|---|
Problema | Pascal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int n,d,k,a[100][100];
int main()
{
freopen("pascal.in","r",stdin);
freopen("pascal.out","w",stdout);
cin>>n>>d;
++n;
for(int i=1;i<=n;i++)
a[i][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
a[i][j]=a[i-1][j]+a[i-1][j-1];
}
for(int j=1;j<=n/2;j++)
if(a[n][j]%d==0)
k++;
cout<<k+1;
return 0;
}