Cod sursa(job #2341517)
| Utilizator | Data | 11 februarie 2019 21:33:52 | |
|---|---|---|---|
| Problema | Pascal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define NM 5000005
using namespace std;
ifstream fin ("pascal.in");
ofstream fout ("pascal.out");
int n, d, nr, dp[2][NM];
int main()
{
fin >> n >> d;
dp[1][1] = 1;
for(int i=2; i<=n-1; i++)
for(int j=1; j<=i; j++)
dp[i%2][j] = (dp[(i-1)%2][j] + dp[(i-1)%2][j])%d;
for(int i=1; i<=n-1; i++)
if(dp[n%2][i] == 0)
nr++;
fout << nr;
return 0;
}
