Pagini recente » Cod sursa (job #2758768) | Cod sursa (job #1783496) | Cod sursa (job #3163347) | Cod sursa (job #192804) | Cod sursa (job #340253)
Cod sursa(job #340253)
#include<stdio.h>
#include<string.h>
#define mod 2000003
int n,p;
int v[3][5004];
inline int min(int a, int b)
{
if(a<b)
return a;
return b;
}
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d%d",&n,&p);
int i,j,lim;
n--;
p--;
v[0][0]=1;
for(i=1;i<=n;i++)
{
v[i&1][0]=1;
for(j=1;j<=i;j++)
v[i&1][j]=(v[i-1&1][j-1]+v[i-1&1][j])%mod;
}
printf("%d\n",v[n&1][p]);
return 0;
}