Data update

Task/Perfect-numbers/ALGOL-60/perfect-numbers.alg

@@ -1,10 +1,10 @@
 begin
 
-comment - return p mod q;
-integer procedure mod(p, q);
-  value p, q; integer p, q;
+comment - return n mod m;
+integer procedure mod(n, m);
+  value n, m; integer n, m;
 begin
-  mod := p - q * entier(p / q);
+  mod := n - m * entier(n / m);
 end;
 
 comment - return true if n is perfect, otherwise false;
@@ -38,6 +38,6 @@ for i := 2 step 1 until 10000 do
     end;
 outstring(1,"\n");
 outinteger(1,found);
-outstring(1,"perfect numbers were found");
+outstring(1," were found");
 
 end

Task/Perfect-numbers/EasyLang/perfect-numbers.easy

@@ -1,13 +1,18 @@
-func perf n .
-   for i = 1 to n - 1
+fastfunc perf n .
+   i = 1
+   while i < n
       if n mod i = 0
          sum += i
       .
+      i += 1
    .
-   return if sum = n
+   if sum = n
+      return 1
+   .
+   return 0
 .
 for i = 2 to 10000
    if perf i = 1
-      print i
+      write i & " "
    .
 .

Task/Perfect-numbers/S-BASIC/perfect-numbers.basic

@@ -1,8 +1,8 @@
 $lines
 
-rem - return p mod q
-function mod(p, q = integer) = integer
-end = p - q * (p/q)
+rem - return n mod m
+function mod(n, m = integer) = integer
+end = n - m * (n/m)
 
 rem - return true if n is perfect, otherwise false
 function isperfect(n = integer) = integer