ac1182.pas

某牛人写的acm.tongji.edu.cn上大部分ac的代码,仅供学习研究,请不要用来作弊

program tju1182;
const
  maxn=1000;
  tests=2500;
  maxm=11207;
var
  k,m,pre:array[1..tests]of word;
  last,sol:array[1..maxn]of word;
  rem:array[1..maxm]of word;
  t,i,j:word;
begin
  repeat
    inc(t);read(i,j);
    if i=0 then break;
    k[t]:=j;pre[t]:=last[i];last[i]:=t;
  until false;

  for i:=1 to maxn do begin
    fillchar(sol,sizeof(sol),0);
    for j:=1 to maxm do begin
      rem[j]:=(j+rem[j]) mod i;
      if rem[j]=0 then rem[j]:=i;
      if sol[rem[j]]=0 then sol[rem[j]]:=j;
    end;
    while last[i]>0 do begin
      m[last[i]]:=sol[k[last[i]]];
      last[i]:=pre[last[i]];
    end;
  end;

  for i:=1 to t-1 do
    writeln(m[i]);
end.