RosettaCodeData/Task/Perfect-numbers/Simula/perfect-numbers.simula
2019-09-12 10:33:56 -07:00

8 lines
185 B
Text

BOOLEAN PROCEDURE PERF(N); INTEGER N;
BEGIN
INTEGER SUM;
FOR I := 1 STEP 1 UNTIL N-1 DO
IF MOD(N, I) = 0 THEN
SUM := SUM + I;
PERF := SUM = N;
END PERF;