Numbers with prime digits whose sum is 13: Difference between revisions

→‎{{header|C#|CSharp}}: added alternative solution, thanks to Nigel
(→‎{{header|C#|CSharp}}: added alternative solution, thanks to Nigel)
Line 69:
<pre style="white-space:pre-wrap;">337 355 373 535 553 733 2227 2272 2335 2353 2533 2722 3235 3253 3325 3352 3523 3532 5233 5323 5332 7222 22225 22252 22333 22522 23233 23323 23332 25222 32233 32323 32332 33223 33232 33322 52222 222223 222232 222322 223222 232222 322222
</pre>
== Alternate ==
Based in '''Nigel Galloway's''' suggestion from the discussion page.
<lang csharp>class Program {
 
static void Main(string[] args) { int[] lst; int sum;
var w = new System.Collections.Generic.List<(int digs, int sum)> {};
foreach (int x in lst = new int[] { 2, 3, 5, 7 } ) w.Add((x, x));
while (w.Count > 0) { var i = w[0]; w.RemoveAt(0);
foreach (var j in lst) if ((sum = i.sum + j) == 13)
System.Console.Write ("{0}{1} ", i.digs, j);
else if (sum < 12)
w.Add((i.digs * 10 + j, i.sum + j)); } }
}</lang>
Same output.
 
=={{header|F_Sharp|F#}}==