ac1273.pas

这是在网络上搜集到的在东京大学的ACM上面解决的一些题目的源码

{$Q-,R-}
program tju1273;
const
  maxn=100;
  maxk=(maxn-1)*maxn shr 2;
  modulo=10000;
var
  s:array[1..maxn,-1..maxk]of word;
  count:array[1..maxn]of word;
  n,k:longint;
begin
  for k:=0 to maxk do s[1,k]:=1;
  for n:=2 to maxn do begin
    for k:=0 to n-1 do s[n,k]:=(s[n,k-1]+s[n-1,k]) mod modulo;
    for k:=n to maxk do s[n,k]:=(s[n,k-1]+s[n-1,k]-s[n-1,k-n]+modulo) mod modulo;
  end;

  for n:=1 to maxn do count[n]:=(n-1)*n shr 1;
  repeat
    read(n,k);
    if k>count[n] then writeln(0) else begin
      if k*2>count[n] then k:=count[n]-k;
      writeln((s[n,k]-s[n,k-1]+modulo) mod modulo);
    end;
  until seekeof;
end.