ac1238.pas

来自「这是在网络上搜集到的在东京大学的ACM上面解决的一些题目的源码」· PAS 代码 · 共 31 行

program tju1238;
const
  maxk=1000;
var
  a:array[1..maxk]of longint;
  t,u,k,i,x,y:longint;
begin
  read(t);
  for u:=1 to t do begin
    read(k);x:=0;
    for i:=1 to k do begin
      read(a[i]);x:=x xor a[i];
    end;
    if x=0 then
      writeln('lose')
    else begin
      for i:=1 to k do begin
        y:=a[i] xor x;
        if a[i]>=y then begin
          writeln(a[i]-y,' ',i);
          a[i]:=y;
          break;
        end;
      end;
      for i:=1 to k-1 do
        write(a[i],' ');
      writeln(a[k]);
    end;
  end;
end.