Cod sursa(job #2109533)
Utilizator | Data | 19 ianuarie 2018 20:48:08 | |
---|---|---|---|
Problema | Sandokan | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f ("sandokan.in");
ofstream g ("sandokan.out");
int n,k,v[5001],i,h,j,a;
long long ma;
int main()
{
f>>n>>k;
for(i=1;i<=n;++i)
f>>v[i];
a=n;
while(n>=k)
{
j++;
n=n/k;
}
if(j>=2)
n=n+1;
n=n+a%k;
n=n%k;
ma=1;
for(i=2;i<=n;++i)
ma=ma*i;
g<<ma%2000003;
return 0;
}