ac1277.pas

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

program tju1277;
const
  maxw=200;
var
  count:array[0..maxw]of word;
  w,n,i,x:longint;
begin
  repeat
    fillchar(count,sizeof(count),0);
    read(w,n);
    for i:=1 to n do begin
      read(x);inc(count[x]);
    end;

    x:=0;
    for i:=0 to (w-1) shr 1 do begin
      inc(x,count[i]);
      if count[w-i]>x then begin dec(n,x);x:=0;end
                      else begin dec(n,count[w-i]);dec(x,count[w-i]);end;
    end;
    if not odd(w) then inc(x,count[w shr 1]);
    writeln(n-x shr 1);
  until seekeof;
end.