Cod sursa(job #1166223)
Utilizator | Data | 3 aprilie 2014 12:59:26 | |
---|---|---|---|
Problema | Sandokan | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
#include <cstring>
#define mod 2000003
using namespace std;
ifstream f("sandokan.in");
ofstream g("sandokan.out");
int n,k,a[5001],i,j,b[5001];
int main(){
f>>n>>k;
n--,k--;
k=n%k;
b[0]=1;
for(i=1;i<=n;i++){
a[0]=1;
for(j=1;j<=i;j++)
a[j]=b[j]+b[j-1];
if(a[j]>=mod)
a[j]-=mod;
memcpy(b,a,sizeof(a));
}
g<<b[k];
}