challenge-199/deadmarshal/pascal/ch1.pas


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

program Ch1;

{$mode objfpc}

uses
  SysUtils,Types;

function GoodPairs(Arr:TIntegerDynArray):Integer;
var
  I,J:Integer;
begin
  Result := 0;
  for I := Low(Arr) to High(Arr) do
    for J := I+1 to High(Arr) do
      if Arr[I] = Arr[J] then Inc(Result);
end;

begin
  WriteLn(GoodPairs([1,2,3,1,1,3]));
  WriteLn(GoodPairs([1,2,3]));
  WriteLn(GoodPairs([1,1,1,1]));
end.