Pagini recente » Cod sursa (job #2947329) | Cod sursa (job #490431) | Cod sursa (job #845485) | Cod sursa (job #2736917) | Cod sursa (job #2901726)
#include <fstream>
#define mod 2000003
using namespace std;
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
int n,k,i,f[5001];
int putere(int a,int n) {
int p=1;
while (n!=0) {
if (n%2!=0)
p=1LL*p*a%mod;
a=1LL*a*a%mod;
n/=2;
}
return p;
}
int comb(int n,int k) {
return 1LL*f[n]*putere(f[k],mod-2)%mod*putere(f[n-k],mod-2)%mod;
}
int main() {
fin>>n>>k;
f[0]=1;
for (i=1;i<=n;i++)
f[i]=1LL*f[i-1]*i%mod;
fout<<comb(n-1,(n-1)%(k-1));
return 0;
}