vijos p1739(计算系数(NOIP 2011系列))
大概思路, 杨辉三角+递推,不是很难,可是被取模坑了,提交了5 ,6次才过。
还要加油啊!
1 program P1739; 2 var 3 l,i,j,x,y,k,m,n,q:longint; 4 a:array[0..10000,0..10000] of longint; 5 begin 6 read(x,y,k,n,m); 7 a[1,1]:=x mod 10007; a[1,2]:=y mod 10007; 8 for i:=2 to k do 9 for j:=1 to i+1 do 10 begin 11 a[i,j]:=((y mod 10007)*a[i-1,j-1]+(x mod 10007)*a[i-1,j])mod 10007; 12 if(i=k)and(j=m+1) then 13 begin 14 write(a[i,j] mod 10007); 15 halt; 16 end; 17 end; 18 19 end.