aboutsummaryrefslogtreecommitdiff
path: root/challenge-140/abigail/pascal/ch-2.p
blob: 9eb1661bfc4dd002f243eb61679b12d2a8b97e24 (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
Program ch2;

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

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

uses
    math;

var
    i, j, k, n, s, d: longint;

begin
    while not eof do begin
        readln (i, j, k);

        n := 0;

        while k > 0 do begin
            inc (n);
            s := round (sqrt (n));
            for d := 1 to s do begin
                if n mod d = 0 then begin
                    if (d <= i) and (n / d <= j) then begin dec (k); end;
                    if (d <= j) and (n / d <= i) then begin dec (k); end;
                    if (n  = d * d)              then begin inc (k); end;
                end
            end
        end;
        writeln (n);
    end
end.