poz/jpp
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

oops lol

Browse source
This commit is contained in:
jacekpoz 2024-03-22 10:23:47 +01:00
parent 6286d07611
commit 4b0b0186f2
Signed by: poz
SSH key fingerprint: SHA256:JyLeVWE4bF3tDnFeUpUaJsPsNlJyBldDGV/dIKSLyN8
1 changed files with 0 additions and 76 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

76
zad2/src/module.adb
View file

@ -1,76 +0,0 @@
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
package body Module is
function factorial(n : Natural) return Natural is
begin
if (n = 0 or n = 1 ) then
return 1;
end if;
return n * factorial(n - 1);
end factorial;
function gcd(a : Natural; b : Natural) return Natural is
begin
if b = 0 then
return a;
end if;
return gcd(b, a mod b);
end gcd;
function gcdExtended(a : Integer; b : Integer; x : out Integer; y : out Integer) return Integer is
x1 : Integer;
y1 : Integer;
d : Integer;
begin
if b = 0 then
x := 1;
y := 0;
return a;
end if;
d := gcdExtended(b, a rem b, x1, y1);
x := y1;
y := x1 - y1 * (a / b);
return d;
end gcdExtended;
function diophantine(a : Integer; b : Integer; c : Integer) return Result is
r : Result;
x0 : Integer := 0;
y0 : Integer := 0;
g : Integer := gcdExtended(abs a, abs b, x0, y0);
begin
r.n := 0;
r.m := 0;
r.resultExists := False;
if a = 0 and b = 0 then
return r;
end if;
if (c rem g) /= 0 then
return r;
end if;
x0 := x0 * (c / g);
y0 := y0 * (c / g);
if a < 0 then
x0 := -x0;
end if;
if b < 0 then
y0 := -y0;
end if;
r.n := x0;
r.m := y0;
r.resultExists := True;
return r;
end diophantine;
end Module;