Cod sursa(job #244219)
Utilizator | Data | 14 ianuarie 2009 18:31:34 | |
---|---|---|---|
Problema | Sandokan | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
var n,k,p:qword;
i,pp,ppp:longint;
f:text;
begin
assign(f,'sandokan.in');reset(f);
read(f,n,k); {
for i:=1 to n do read(f,a[i]); }
close(f);
p:=1;
pp:=n mod (k-1);
for i:=n-pp+1 to n-1 do p:=p*i mod 2000003;
for i:=2 to pp-1 do p:=p div i;
assign(f,'sandokan.out');rewrite(f);
write(f,p*(n-1) mod 2000003);
close(f);
end.