Cod sursa(job #2840667)
Utilizator | Data | 28 ianuarie 2022 16:43:19 | |
---|---|---|---|
Problema | Sandokan | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#define MOD 2000003
using namespace std;
ifstream fin ("sandokan.in");
ofstream fout ("sandokan.out");
int n, k, x, c[5003][5003];
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
fin>>x;
if(n==k)
{fout<<1;
return 0;}
c[0][0]=1;
for(int i=1; i<=n; i++)
{
c[i][0]=1;
for(int j=1; j<=i; j++)
c[i][j]=(1ll*c[i-1][j]+c[i-1][j-1])%MOD;
}
fout<<c[n-1][(n-1)%(k-1)];
return 0;
}