Odd squarefree semiprimes: Difference between revisions
m
C# - Edited code & output to reflect new task name
(→{{header|ALGOL 68}}: Calculate a more sensible number of primes) |
m (C# - Edited code & output to reflect new task name) |
||
Line 63:
=={{header|C#|CSharp}}==
This reveals a set of
<lang csharp>using System; using static System.Console; using System.Collections;
using System.Linq; using System.Collections.Generic;
Line 73:
res.Add(amt = pr[p] * pr[q]); } res.Sort(); foreach(var item in res.TakeWhile(x => x < lmt))
Write("{0,4} {1}", item, ++c % 20 == 0 ? "\n" : "");
Write("\n\nCounted {0}
class PG { public static IEnumerable<int> Primes(int lim) {
Line 93:
933 939 943 949 951 955 959 965 973 979 985 989 993 995
Counted 194
=={{header|C++}}==
| |||