|
|
1.1 root 1: program recursivegcd(output);
2: var
3: x, y, n: integer;
4: function gcd(m,n: integer): integer;
5: begin
6: if n=0 then
7: gcd := m else
8: gcd := gcd(n, m mod n);
9: end;
10: procedure try(a, b: integer);
11: begin
12: writeln(a, b, gcd(a, b));
13: end;
14: begin
15: try(18, 27);
16: try(312, 2142);
17: try(61, 53);
18: try(98, 868);
19: end.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.