Cod sursa(job #3372929)
| Utilizator | Data | 5 noiembrie 2026 16:43:50 | |
|---|---|---|---|
| Problema | Sandokan | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
#define mod 2000003
int c[5001];
int main()
{
int n, k, x;
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>x;
}
int r=(n-1)%(k-1);
c[0]=1;
for(int i=1;i<=n-1;i++){
for(int j=i;j>=1;j--){
c[j]=(c[j]+c[j-1])%mod;
}
}
fout<<c[r];
return 0;
}
