Sum of square and cube digits of an integer are primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 178: / Line 178: @@
 ==={{header|Tiny BASIC}}===
+{{works with|TinyBasic}}
 This can only go up to 31 because 32^3 is too big to fit in a signed 16-bit int.
-<syntaxhighlight lang="tinybasic">REM      N, the number to be tested
+<syntaxhighlight lang="basic">10 REM Sum of square and cube digits of an integer are primes
-REM      D, the digital sum of its square or cube
+REM N, the number to be tested
+REM D, the digital sum of its square or cube
-REM      T, temporary variable
+REM T, temporary variable
-REM      Z, did D test as prime or not
+REM Z, did D test as prime or not
-    LET N = 1
+LET N = 1
-LET T = N*N*N
+LET T = N * N * N
-    GOSUB 20
+GOSUB 200
-    GOSUB 30
+GOSUB 260
-    IF Z = 0 THEN GOTO 11
+IF Z = 0 THEN GOTO 160
-    LET T = N*N
+LET T = N * N
-    GOSUB 20
+GOSUB 200
-    GOSUB 30
+GOSUB 260
-    IF Z = 0 THEN GOTO 11
+IF Z = 0 THEN GOTO 160
-    PRINT N
+PRINT N
 IF N = 31 THEN END
-    LET N = N + 1
+LET N = N + 1
-    GOTO 10
+GOTO 70
+REM Calculate sum of digits
-LET D = 0
-IF T = 0 THEN RETURN
+LET D = 0
+IF T = 0 THEN RETURN
-    LET D = D + (T-(T/10)*10)
-    LET T = T/10
+LET D = D + (T - (T / 10) * 10)
-    GOTO 21
+LET T = T / 10
+GOTO 210
-LET Z = 0
+REM Check if is prime
-    IF D < 2 THEN RETURN
-    LET Z = 1
+LET Z = 0
-    IF D < 4 THEN RETURN
+IF D < 2 THEN RETURN
-    LET Z = 0
+LET Z = 1
-    IF (D/2)*2 = D THEN RETURN
+IF D < 4 THEN RETURN
-    LET T = 1
+LET Z = 0
+IF (D / 2) * 2 = D THEN RETURN
-LET T = T + 2
+LET T = 1
-    IF T*T>D THEN GOTO 32
+LET T = T + 2
-    IF (D/T)*T=D THEN RETURN
-    GOTO 31
+IF T * T > D THEN GOTO 370
+IF (D / T) * T = D THEN RETURN
-LET Z = 1
+GOTO 330
-    RETURN</syntaxhighlight>
+LET Z = 1
-{{out}}<pre>
+RETURN</syntaxhighlight>
+{{out}}<pre>16