Cod sursa(job #48232)

Utilizator radu_voroneanuVoroneanu Radu Stefan radu_voroneanu Data 4 aprilie 2007 15:13:12
Problema Loto Scor 85
Compilator fpc Status done
Runda Arhiva de probleme Marime 1.54 kb
var a:array[1..8000000] of longint;
    n,i,j,k,t,op,s,q:longint;
    b,d,w:array[1..8000000] of int64;
    c:array[1..200] of longint;
    f,g:text;
    ok:boolean;
procedure pozitie(var m:longint; p,u:longint);
var i,j,di,dj,aux:longint;
begin
di:=0;
dj:=-1;
i:=p;
j:=u;
while i<j do
begin
if a[i]<a[j] then
begin
aux:=di;
di:=-dj;
dj:=-aux;
aux:=a[i];
a[i]:=a[j];
a[j]:=aux;
aux:=d[i];
d[i]:=d[j];
d[j]:=aux;
end;
i:=i+di;
j:=j+dj;
end;
m:=i;
end;
procedure quick(p,u:longint);
var m:longint;
begin
if p<u then
begin
pozitie(m,p,u);
quick(p,m-1);
quick(m+1,u);
end;
end;
function cauta(x,st,dr:longint):longint;
 var mij:longint;
 begin
  if st>dr then cauta:=0
  else
   begin
    mij:=(st+dr)div 2;
    if a[mij]=x then
     cauta:=mij
    else
     if a[mij]<x then
      cauta:=cauta(x,st,mij-1)
     else
      cauta:=cauta(x,mij+1,dr);
   end;
 end;
begin
 assign(f,'loto.in'); reset(f);
 assign(g,'loto.out'); rewrite(g);
 read(f,n,s);
 for i:=1 to n do
  read(f,c[i]);
 for i:=1 to n do
  for j:=i to n do
   for k:=j to n do begin
    inc(op);
    a[op]:=c[i]+c[j]+c[k];
    d[op]:=i*1000000+j*1000+k;
   end;
 quick(1,op);
 i:=1;
 ok:=false;
 for i:=1 to op do begin
  q:=cauta(s-a[i],1,op);
  if q<>0 then begin
   writeln(g,c[d[i] div 1000000],' ',c[(d[i] mod 1000000) div 1000],' ',c[d[i] mod 1000],' ',c[d[q] div 1000000],' ',c[(d[q] mod 1000000) div 1000],' ',c[d[q] mod 1000]);
   ok:=true;
   break;
  end;
 end;
 if ok=false then
  writeln(g,'-1');
 close(f); close(g);
end.