Cod sursa(job #1730104)
Utilizator | Data | 16 iulie 2016 13:05:02 | |
---|---|---|---|
Problema | Sandokan | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<iostream>
#include<fstream>
#define MOD 2000003
using namespace std;
long long lgput(long long baza, long long p)
{
if(p==1)
return baza;
if(p%2==0)
return lgput((baza*baza)%MOD,p/2);
else return (baza*lgput(baza,p-1))%MOD;
}
long long n,k,sol,nr;
int main()
{
ifstream cin("sandokan.in");
ofstream cout("sandokan.out");
cin>>n>>k;
n--;
k--;
sol=nr=1;
for(int i=1;i<=n%k;i++)
sol=sol*(n-i+1)%MOD*lgput(i,MOD-2)%MOD;
cout<<sol;
return 0;
}