Cod sursa(job #1292657)
Utilizator | Data | 14 decembrie 2014 16:30:52 | |
---|---|---|---|
Problema | Sandokan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
# include <bits/stdc++.h>
using namespace std;
ifstream fi("sandokan.in");
ofstream fo("sandokan.out");
int s[2][5005];
int main(void)
{
int n,k;
fi>>n>>k;
bool ok=1;
s[ok][1]=1;
for (int i=2;i<=n;++i,ok=!ok)
{
s[!ok][i]=1;
for (int j=1;j<i;++j) s[!ok][j] = (s[i-1][j-1] + s[i-1][j]) % 2000003;
}
return fo << s[ok][k] << '\n',0;
}