分````
       var
          a:array[1..201,1..6] of longint;
          i,j,k,h,l:integer;
       begin 
          readln(n,k);
          fillchar(a,sizeof(a),0);
          for i:=1 to 201 do
            begin
            a[i,1]:=1;
            a[i,2]:=i div 2;
            end;
         for i:=3 to 201 do 
            begin
              for j:=3 to 6 do
                 begin
                   for h:=1 to j do 
                     a[i,j]:=a[i-1,h]+a[i,j];
                 end;
            end;
        writeln(a[n,k]);
     end.
   程序有可能有错```
           起其中思想是 ````a[n,k]是等于a[n-k，。] 的前k项和
           例如：a[200,6]是a[194,1]+a[194,2]+a[194,3a[194,4]+a[194,5]+a[194,6]

典型的“动归”```