Cod sursa(job #2291382)
| Utilizator | Data | 27 noiembrie 2018 22:10:50 | |
|---|---|---|---|
| Problema | Sandokan | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 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],v[5003],t,p;
int main()
{
f>>n>>p;
k=n;
while(k>=p) k-=(p-1);
for(int i=1;i<=n;++i) f>>v[i];
t=0;
c[t]=1;
for(int i=1;i<=n;++i,t^=1)
{
c[0]=c[i]=1;
for(int j=i-1;j;--j) c[j]=(c[j]+c[j-1])%mod;
}
g<<c[k-1];
return 0;
}
