Cod sursa(job #1973904)
Utilizator | Data | 26 aprilie 2017 12:59:30 | |
---|---|---|---|
Problema | Sandokan | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sandokan.in");
ofstream out("sandokan.out");
int C[2][5003];
int main() {
int n,k;
in >> n >> k;
for(int i = 1; i <= n-1; i++) {
C[i%2][1] = i;
for(int j = 2; j <= k-1; j++) {
C[i%2][j] = (C[!(i%2)][j-1] + C[!(i%2)][j])%2000003;
}
}
out << C[(n-1)%2][k-1];
return 0;
}