aboutsummaryrefslogtreecommitdiff
path: root/challenge-243/deadmarshal/pascal/ch1.pas
blob: bd84bf950b1a6fc030a131925b8fcd8db57e0ad6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
program Ch1;

{$mode objfpc}
uses
  SysUtils,Types;

var
  A1,A2:TIntegerDynArray;
  
function ReversePairs(var Arr:TIntegerDynArray):Integer;
var
  I,J:Integer;
begin
  Result := 0;
  for I := Low(Arr) to High(Arr)-1 do
    for J := I+1 to High(Arr) do
      if Arr[I] > (2 * Arr[J]) then Inc(Result);
end;

begin
  A1 := [1,3,2,3,1];
  A2 := [2,4,3,5,1];
  WriteLn(ReversePairs(A1));
  WriteLn(ReversePairs(A2));
end.