Cod sursa(job #2291326)
| Utilizator | Data | 27 noiembrie 2018 21:42:13 | |
|---|---|---|---|
| Problema | Sandokan | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define mod 2000003
using namespace std;
ifstream f ("sandokan.in");
ofstream g ("sandokan.out");
typedef long long ll;
int n,k,c[5003][3],v[5003],t;
int main()
{
f>>n>>k;
for(int i=1;i<=n;++i) f>>v[i];
t=0;
c[t][0]=1;
for(int i=2;i<=n;++i,t^=1)
{
c[t][1]=c[t][i]=1;
for(int j=2;j<i;++j) c[t][j]=(c[t^1][j]+c[t^1][j-1])%mod;
}
g<<c[t^1][k];
return 0;
}
