aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-02-01 16:33:20 -08:00
parent 5150844a7d
commit 4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
Download patch file Download diff file Expand all files Collapse all files

57
Task/Curzon-numbers/Ada/curzon-numbers.ada
View file

@ -1,57 +0,0 @@
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Long_Long_Integer_Text_IO; use Ada.Long_Long_Integer_Text_IO;
procedure Curzon is
function Mod_Pow(Base, Exp, Modulo : Long_Long_Integer) return Long_Long_Integer is
Result : Long_Long_Integer := 1;
B : Long_Long_Integer := Base mod Modulo;
E : Long_Long_Integer := Exp;
begin
if Modulo = 1 then return 0; end if;
while E > 0 loop
if (E mod 2) = 1 then
Result := (Result * B) mod Modulo;
end if;
B := (B * B) mod Modulo;
E := E / 2;
end loop;
return Result;
end Mod_Pow;
function Curzon_Check(K, N : Long_Long_Integer) return Boolean is
R : Long_Long_Integer := K * N;
begin
return Mod_Pow(K, N, R + 1) = R;
end Curzon_Check;
N : Long_Long_Integer;
Count : Integer;
begin
for K in Long_Long_Integer range 2..10 when K mod 2 = 0 loop
Put("The first 50 Curzon numbers of base "); Put(K, 1); Put(":"); New_Line;
N := 1;
Count := 1;
while Count <= 1000 loop
if Curzon_Check(K, N) then
if Count <= 50 then
Put(N, 4);
if Count mod 10 = 0 then
New_Line;
else
Put(" ");
end if;
end if;
if Count = 1000 then
Put("The 1000th Curzon number of base "); Put(K, 1); Put(": "); Put(N, 5);
New_Line(2);
end if;
Count := @ + 1;
end if;
N := @ + 1;
end loop;
end loop;
end Curzon;

18
Task/Curzon-numbers/Arturo/curzon-numbers.arturo
View file

@ -1,24 +1,12 @@
curzon?: function [n,base]->
curzon?: function [n,base] ->
zero? (inc base^n) % inc base*n
first50: function [b][
result: new []
i: 1
while [50 > size result][
if curzon? i b -> 'result ++ i
i: i + 1
]
return result
select.first:50 1..∞ 'i -> curzon? i b
]
oneThousandth: function [b][
cnt: 0
i: 1
while [cnt < 1000][
if curzon? i b -> cnt: cnt+1
i: i + 1
]
return dec i
select.n:1000 1..∞ 'i -> curzon? i b
]
loop select 2..10 => even? 'withBase [