对于此题我不感兴趣

Program P1117;

var

f : array[-200..200,-6..6] of longint;

n, k, i, j : longint;

begin

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

readln(n, k);

for i := 1 to n do

f[i, 1] := 1;

for i := 2 to n do

for j := 1 to k do

f := f[i-1, j-1]+f[i-j, j];

writeln(f[n, k]);

end.

方程是我找规律找的

你是不是为VJ出过题啊!