讨论 / 求解脱
qq543099676 2012-04-26 21:37:00
点我顶贴 收藏 删除
program ex;

var i,j,a,b,k,m,n:longint;

sum1,sum2:longword;

f:array[0..1000,0..1000]of longword;

begin

fillchar(f,sizeof(f),0);

sum1:=1;sum2:=1;

read(a,b,k,n,m);

f[1,1]:=1;

for i:=2 to k+1 do

for j:=1 to i do

f[i,j]:=(f[i-1,j-1]+f[i-1,j])mod 10007;

for i:=1 to n do

begin

sum1:=sum1*a;

if sum1>=10007 then sum1:=sum1 mod 10007;

end;

for i:=1 to m do

begin

sum2:=sum2*b;

if sum2>=10007 then sum2:=sum2 mod 10007;

end;

write(f[k+1,m+1]*sum1*sum2 mod 10007);

end.

查看更多回复
提交回复