Pagini recente » Cod sursa (job #952300) | Cod sursa (job #876400) | Cod sursa (job #523002) | Cod sursa (job #853264) | Cod sursa (job #1782516)
#include <cstdio>
using namespace std;
short a[5000000];
int n, d;
int main()
{
freopen("pascal.in", "r", stdin);
freopen("pascal.out", "w", stdout);
scanf("%d%d", &n, &d);
a[0] = 1;
for(int i = 1; i < n ; ++i){
a[i] = 1;
for(int j = i - 1; j >= 1 ; --j)
a[j] = (a[j - 1] + a[j]) % d;
}
int Sol = 0;
for(int j = n - 1; j >= 1 ; --j)
if((a[j] + a[j - 1]) % d == 0) ++Sol;
printf("%d", Sol);
return 0;
}