49 lines
407 B
Plaintext
49 lines
407 B
Plaintext
for x = 1 to 120
|
|
|
|
let n = x
|
|
let c = 0
|
|
|
|
do
|
|
|
|
if int(n mod 2) = 0 then
|
|
|
|
let n = int(n / 2)
|
|
let c = c + 1
|
|
|
|
endif
|
|
|
|
wait
|
|
|
|
loop int(n mod 2) = 0
|
|
|
|
for i = 3 to sqrt(n) step 2
|
|
|
|
do
|
|
|
|
if int(n mod i) = 0 then
|
|
|
|
let n = int(n / i)
|
|
let c = c + 1
|
|
|
|
endif
|
|
|
|
wait
|
|
|
|
loop int(n mod i) = 0
|
|
|
|
next i
|
|
|
|
if n > 2 then
|
|
|
|
let c = c + 1
|
|
|
|
endif
|
|
|
|
if prime(c) then
|
|
|
|
print x, " ",
|
|
|
|
endif
|
|
|
|
next x
|