Cod sursa(job #1973945)
Utilizator | Razvan Dumitru razvand | Data | 26 aprilie 2017 14:51:04 |
---|---|---|---|
Problema | Sandokan | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 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;
int t = n;
while(t >= k)
t -= k-1;
t--;
n--;
k--;
for(int i = 1; i <= n; i++) {
C[i%2][0] = 1;
for(int j = 1; j <= t; j++) {
C[i%2][j] = (C[!(i%2)][j-1] + C[!(i%2)][j])%2000003;
}
}
out << C[(n)%2][t];
return 0;
}