ac1039.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1039;
const
  maxn=50;
var
  ans:array[0..maxn,2..5]of qword;
  n,m:byte;
begin
  for m:=2 to 5 do begin
    ans[0,m]:=1;
    for n:=1 to m-1 do
      ans[n,m]:=ans[n-1,m]*2;
    ans[m,m]:=ans[m-1,m]*2-1;
    for n:=m+1 to maxn do
      ans[n,m]:=ans[n-1,m]*2-ans[n-m-1,m];
  end;
  repeat
    read(n,m);
    writeln(ans[n,m]);
  until seekeof;
end.