blob: c97107e46a53e9aca4287a1bbe44ad3d2fb16fdb (
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
Program ch1;
(* *)
(* See https://theweeklychallenge.org/blog/perl-weekly-challenge-149 *)
(* *)
(* *)
(* Run as: fpc -och-1.out ch-1.p; ./ch-1.out < input-file *)
(* *)
uses
fgl;
type
fib_t = longint;
var
n, k: integer;
fib_prev: fib_t;
fib_last: fib_t;
fib: specialize TFPGMap <fib_t, boolean>;
function digit_sum (n: longint): integer;
const
base = 10;
var
sum: integer;
begin
sum := 0;
while n > 0 do begin
sum := sum + (n mod base);
n := n div base;
end;
digit_sum := sum;
end;
procedure init_fib;
begin
fib := specialize TFPGMap <fib_t, boolean> . Create;
fib_prev := 0;
fib_last := 1;
fib . Add (fib_prev, true);
fib . Add (fib_last, true);
end;
function is_fib (n: fib_t): boolean;
var
t: fib_t;
begin
while fib_last < n do begin
t := fib_last;
fib_last := fib_prev + fib_last;
fib_prev := t;
fib . Add (fib_last, true);
end;
is_fib := fib . IndexOf (n) >= 0;
end;
begin
init_fib;
while not eof do begin
readln (n);
k := 0;
while n > 0 do begin
if is_fib (digit_sum (k)) then begin
write (k, ' ');
dec (n);
end;
inc (k);
end;
writeln ('');
end;
end.
|
