Descending primes: Difference between revisions

=={{header|FreeBASIC}}==

{{trans|XPL0}}

<lang freebasic>#include "isprime.bas"

#include "sort.bas"

Dim As Double t0 = Timer

Dim As Integer i, n, tmp, num, cant

Dim Shared As Integer matriz(512)

For i = 0 To 511

n = 0

tmp = i

num = 9

While tmp

If tmp And 1 Then n = n * 10 + num

tmp = tmp Shr 1

num -= 1

Wend

matriz(i) = n

Next i

Sort(matriz())

cant = 0

For i = 1 To Ubound(matriz)-1

n = matriz(i)

If IsPrime(n) Then

Print Using "#########"; n;

cant += 1

If cant Mod 10 = 0 Then Print

End If

Next i

Print Using !"\n\nThere are & descending primes."; cant

Sleep</lang>

{{out}}

<pre> 2 3 5 7 31 41 43 53 61 71

73 83 97 421 431 521 541 631 641 643

653 743 751 761 821 853 863 941 953 971

983 5431 6421 6521 7321 7541 7621 7643 8431 8521

8543 8641 8731 8741 8753 8761 9421 9431 9521 9631

9643 9721 9743 9851 9871 75431 76421 76541 76543 86531

87421 87541 87631 87641 87643 94321 96431 97651 98321 98543

98621 98641 98731 764321 865321 876431 975421 986543 987541 987631

8764321 8765321 9754321 9875321 97654321 98764321 98765431

There are 87 descending primes.</pre>