Descending primes: Difference between revisions
→{{header|11l}}: Alternative solution
Alextretyak (talk | contribs) (Added 11l) |
Alextretyak (talk | contribs) (→{{header|11l}}: Alternative solution) |
||
Line 69:
87 descending primes found
</pre>
Alternative solution:
<syntaxhighlight lang="11l">
F is_prime(p)
I p < 2 | p % 2 == 0
R p == 2
L(i) (3 .. Int(sqrt(p))).step(2)
I p % i == 0
R 0B
R 1B
[Int] descending_primes
L(n) 0 .< 2 ^ 9
V s = ‘’
L(i) (8 .. 0).step(-1)
I n [&] (1 << i) != 0
s ‘’= String(i + 1)
I s != ‘’ & is_prime(Int(s))
descending_primes.append(Int(s))
L(n) sorted(descending_primes)
print(‘#8’.format(n), end' I (L.index + 1) % 5 == 0 {"\n"} E ‘ ’)
print("\n"descending_primes.len‘ descending primes found’)
</syntaxhighlight>
=={{header|ALGOL 68}}==
| |||