Pagini recente » Cod sursa (job #2017590) | Cod sursa (job #2849087) | Cod sursa (job #128974) | Cod sursa (job #172556) | Cod sursa (job #163652)
Cod sursa(job #163652)
#include<fstream.h>
long i,j,a,n,k,b,s1[5005],s2[5005];
int main(){
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a;
if(k==2 || k==n)
fout<<"1";
else if(k==n-1)
fout<<k<<'\n';
else{
a=n;
b=k;
while(a-b+1>b);
a=a-b+1;
if(a==b || a==1)
fout<<"1"<<'\n';
else{
s1[1]=1;
for(i=2;i<n;i++){
s2[1]=i;
s2[i]=1;
for(j=2;j<i;j++)
s2[j]=(s1[j]+s1[j-1])%2000003;
for(j=1;j<=i;j++)
s1[j]=s2[j];
}
fout<<s2[k-1]<<'\n';
}
}
fin.close();
fout.close();
return 0;
}