Pagini recente » Cod sursa (job #713865) | Cod sursa (job #2591558) | Cod sursa (job #1564027) | Cod sursa (job #1405330) | Cod sursa (job #2556042)
#include <fstream>
std::ifstream f("sandokan.in");
std::ofstream g("sandokan.out");
const int NMAX = 5005;
const int MOD = 2'000'003;
int n,k,x,pascal[2][NMAX];
int main(){
f >> n >> k;
x = n;
while(x > k)
x -= k;
pascal[0][0] = 1;
for(int i = 1;i < n;++i){
for(int j = 0;j <= i;++j)
if(j == 0 || j == i)
pascal[i % 2][j] = 1;
else
pascal[i % 2][j] = (pascal[1 - i % 2][j] + pascal[1 - i % 2][j - 1]) % MOD;
}
g << pascal[(n - 1) % 2][x - 1];
return 0;
}