aboutsummaryrefslogtreecommitdiff
path: root/challenge-139/abigail/pascal/ch-2.p
blob: a5f15ac94e67d01f13d8d5def18e7c385a2b9a53 (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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
Program ch2;

(*                  *)
(* See ../README.md *)
(*                  *)

(*                                           *)
(* Run as: fpc -och-2.out ch-2.p; ./ch-2.out *)
(*                                           *)

var
    BASE:   integer = 10;
    COUNT:  integer =  5;
    number: integer =  1;

function is_long (number: integer): boolean;
    var
        seen: array of boolean;
        rest: integer;
        i:    integer;

    begin
        setlength (seen, number);
        for i := 0 to number - 1 do begin
            seen [i] := false;
        end;

        rest := 0;

        for i := 2 to number do begin
            rest := (rest * BASE + BASE - 1) mod number;
            if seen [rest] then begin
                exit (false);
            end;
            seen [rest] := true;
        end;

        exit (true);
    end;

begin
    while COUNT > 0 do begin
        inc (number);
        if BASE mod number = 0 then begin
            continue;
        end;
        if is_long (number) then begin
            writeln (number);
            dec (COUNT);
        end
    end
end.