Cod sursa(job #1380109)
Utilizator | Data | 6 martie 2015 22:02:40 | |
---|---|---|---|
Problema | Sandokan | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
#define MOD 2000003
using namespace std;
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
int dp[5001],n,n1,k,i,j;
int main()
{
fin>>n>>k;
n1=n;
while(n>=k)
n-=(k-1);
k=n-1;
n=n1-1;
dp[0]=1;
for(i=1;i<=n;i++)
for(j=i;j>0;j--)
dp[j]=(dp[j]+dp[j-1])%MOD;
fout<<dp[k];
return 0;
}