FACUP - The FA cup

Tác giả: flashmt

Ngôn ngữ: Pascal

const maxn=300;
      p:array[1..8] of longint=(2,4,8,16,32,64,128,256);
var n:longint;
    a:array[1..maxn,1..maxn] of real;
    b:array[1..8,1..maxn] of real;
    re:array[1..maxn] of longint;
    t:array[1..maxn] of real;

procedure rf;
var i,j,t:longint;
begin
     readln(n);
     for i:=1 to p[n] do
     begin
          for j:=1 to p[n] do
          begin
               read(t);
               a[i,j]:=t/100;
          end;
          readln;
     end;
end;

procedure calc(rnd,team:longint);
var i,j,l,r,lm,rm:longint;
begin
     l:=((team-1) div p[rnd])*p[rnd]+1;
     r:=l+p[rnd]-1;
     lm:=((team-1) div p[rnd-1])*p[rnd-1]+1;
     rm:=lm+p[rnd-1]-1;
     for i:=l to r do
         if (i<lm) or (i>rm) then
            b[rnd,team]:=b[rnd,team]+b[rnd-1,team]*b[rnd-1,i]*a[team,i];
end;

procedure sort(l,r:longint);
var i,j,z:longint; x,y:real;
begin
     i:=l; j:=r; x:=t[(i+j) div 2];
     repeat
           while t[i]<x do inc(i);
           while t[j]>x do dec(j);
           if i<=j then
           begin
                y:=t[i]; t[i]:=t[j]; t[j]:=y;
                z:=re[i]; re[i]:=re[j]; re[j]:=z;
                inc(i); dec(j);
           end;
     until i>j;
     if i<r then sort(i,r);
     if l<j then sort(l,j);
end;

procedure pr;
var i,j:longint;
begin
     fillchar(b,sizeof(b),0);
     for i:=1 to p[n] do
     begin
          if i mod 2 = 1 then b[1,i]:=a[i,i+1]
          else b[1,i]:=a[i,i-1];
     end;
     for i:=2 to 8 do
         for j:=1 to p[n] do
             calc(i,j);
     for i:=1 to p[n] do
     begin
          t[i]:=b[n,i];
          re[i]:=i;
     end;
     sort(1,p[n]);
end;

procedure wf;
var i:longint;
begin
     for i:=p[n] downto 1 do
         writeln(re[i]);
end;

begin
     rf;
     pr;
     wf;
end.

Download