Pagini recente » Cod sursa (job #3161655) | Cod sursa (job #1969164) | Cod sursa (job #2814500) | Cod sursa (job #3185002) | Cod sursa (job #1973903)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sandokan.in");
ofstream out("sandokan.out");
int C[5003][5003];
int main() {
int n,k;
in >> n >> k;
for(int i = 1; i <= n-1; i++)
C[i][1] = i;
for(int i = 1; i <= n-1; i++) {
for(int j = 2; j <= k-1; j++) {
C[i][j] = (C[i-1][j-1] + C[i-1][j])%2000003;
}
}
out << C[n-1][k-1];
return 0;
}