Rosetta Code

Ascending primes: Difference between revisions

Page Discussion

Ascending primes (view source)

Revision as of 17:55, 2 August 2022

2,363 bytes removed ,  1 year ago
→‎{{header|Visual Basic .NET}}
Line 1,451:
 
=={{header|Visual Basic .NET}}==
<lang vbnet>Module Module1AscendingPrimes▼
"''Every problem can be solved with just the right number of for loops''". Have fun.
▲<lang vbnet>Module Module1
 
Function isprimeisPrime(n As Integer)
If n = 0 ThenMath.Abs(n)
Return False▼
End If▼
If n = 1 Then▼
Return False
End If
If n = 2 Then
Return True
End If
If n = 30 Or n = 1 Or n Mod 2 = 0 Then
Return True
End If
If n = 4 Then
Return False
End If
IfDim nroot =As 5Integer Then= Math.Sqrt(n)
For k = 3 ReturnTo Trueroot Step 2
End If
For k = 2 To n - 1
If n Mod k = 0 Then
Return False
Line 1,483 ⟶ 1,472:
 
Sub Main()
Dim x As Integer▼
Dim y As ArrayList = New ArrayList(1000)
 
ForDim d8queue As Queue(Of Integer) = 1New ToQueue(Of 9Integer)
Dim primes As List(Of xInteger) = d8New List(Of Integer)
 
If isprime(x) Then▼
For k = 1 To y.Add(x)9
▲ Return Falsequeue.Enqueue(k)
▲ End IfNext
 
While queue.Count > 0
▲ Dim xn As Integer = queue.Dequeue()
▲ If n = 1 If (isPrime(n)) Then
▲ If isprime primes.Add(xn) Then
End If
For d7k = d8n Mod 10 + 1 To 9
x = queue.Enqueue(d8n * 10) + d7k)
If isprime(x) Then
y.Add(x)
End If
For d6 = d7 + 1 To 9
x = ((d8 * 10) + d7) * 10 + d6
If isprime(x) Then
y.Add(x)
End If
For d5 = d6 + 1 To 9
x = (((d8 * 10) + d7) * 10 + d6) * 10 + d5
If isprime(x) Then
y.Add(x)
End If
For d4 = d5 + 1 To 9
x = ((((d8 * 10) + d7) * 10 + d6) * 10 + d5) * 10 + d4
If isprime(x) Then
y.Add(x)
End If
For d3 = d4 + 1 To 9
x = (((((d8 * 10) + d7) * 10 + d6) * 10 + d5) * 10 + d4) * 10 + d3
If isprime(x) Then
y.Add(x)
End If
For d2 = d3 + 1 To 9
x = ((((((d8 * 10) + d7) * 10 + d6) * 10 + d5) * 10 + d4) * 10 + d3) * 10 + d2
If isprime(x) Then
y.Add(x)
End If
For d1 = d2 + 1 To 9
x = (((((((d8 * 10) + d7) * 10 + d6) * 10 + d5) * 10 + d4) * 10 + d3) * 10 + d2) * 10 + d1
If isprime(x) Then
y.Add(x)
End If
For d0 = d1 + 1 To 9
x = ((((((((d8 * 10) + d7) * 10 + d6) * 10 + d5) * 10 + d4) * 10 + d3) * 10 + d2) * 10 + d1) * 10 + d0
If isprime(x) Then
y.Add(x)
End If
Next
Next
Next
Next
Next
Next
Next
Next
NextEnd While
 
y.Sort()For Each p As Integer In primes
For Each z As Integer In yConsole.Write(p)
Console.Write(z)
Console.Write(" ")
Next
Line 1,550 ⟶ 1,498:
End Sub
 
End Module</lang>
</lang>
{{Output}}
<pre>2 3 5 7 13 17 19 23 29 37 47 59 67 79 89 127 137 139 149 157 167 179 239 257 269 347 349 359 367 379 389 457 467 479 569 1237 1249 1259 1279 1289 1367 1459 1489 1567 1579 1789 2347 2357 2389 2459 2467 2579 2689 2789 3457 3467 3469 4567 4679 4789 5689 12347 12379 12457 12479 12569 12589 12689 13457 13469 13567 13679 13789 15679 23459 23567 23689 23789 25679 34589 34679 123457 123479 124567 124679 125789 134789 145679 234589 235679 235789 245789 345679 345689 1234789 1235789 1245689 1456789 12356789 23456789</pre>
</pre>
 
=={{header|Vlang}}==
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/320301"