Pagini recente » Cod sursa (job #1535934) | Cod sursa (job #1163284) | Cod sursa (job #114648) | Atasamentele paginii Clasament problemebarajgimnaziu | Cod sursa (job #1849307)
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
const int NMAX = 5e6 + 1;
int d[2][NMAX];
int cnt, MOD, n;
int main()
{
fin >> n >> MOD;
d[0][0] = d[1][0] = 1;
int lst = 0, nxt = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j) {
d[nxt][j] = (d[lst][j] + d[lst][j - 1]) % MOD;
if (i == n && d[nxt][j] == 0)
++cnt;
}
}
fout << cnt;
return 0;
}