Data update

Task/Duffinian-numbers/EasyLang/duffinian-numbers.easy

@@ -1,9 +1,7 @@
 fastfunc isprim num .
    i = 2
    while i <= sqrt num
-      if num mod i = 0
-         return 0
-      .
+      if num mod i = 0 : return 0
       i += 1
    .
    return 1
@@ -23,9 +21,7 @@ func sumdiv num .
       until d > quot
       if num mod d = 0
          sum += d
-         if d <> quot
-            sum += quot
-         .
+         if d <> quot : sum += quot
       .
       d += 1
    .
@@ -37,7 +33,7 @@ func isduff n .
    .
    return 0
 .
-proc duffs . .
+proc duffs .
    print "First 50 Duffinian numbers:"
    n = 4
    repeat