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:

program cyclic_numbers;

function prime(const n: qword): boolean;
var i: qword;
begin
    prime := false;
    i := 3;
    while (i * i <= n) do begin
        if (n mod i = 0) then exit;
        i += 2;
    end;
    prime := true;
end;

procedure divide(const divisor: longword; var len, sum: qword);
var k, r: qword;
begin
    len := 1;
    r := 1;
    sum := 0;
    for k := 1 to (divisor - 1) do begin
        r *= 10;
        sum := sum + (r div divisor);
        r := r mod divisor;
        if (r = 0) or (r = 1) then break;
        len += 1;
    end;
end;

var p, s, l: qword;

begin
    p := 724709891;
    while (p < 729919891) do begin
        if (prime(p)) then begin
            writeln('Checking ', p, '...');
            divide(p, l, s);
            if (l = (p - 1)) then begin
                writeln;
                writeln('Number: ', p);
                writeln('Length of period: ', l);
                writeln('Sum of period: ', s);
                writeln;
            end;
        end;
        p += 100000;
    end;
end.