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

Line 190:
return 0; }</lang>
Same output as C#.
 
=={{header|D}}==
{{trans|C}}
<lang d>import std.stdio;
 
bool primeDigitsSum13(int n) {
int sum = 0;
while (n > 0) {
int r = n % 10;
switch (r) {
case 2,3,5,7:
break;
default:
return false;
}
n /= 10;
sum += r;
}
return sum == 13;
}
 
void main() {
// using 2 for all digits, 6 digits is the max prior to over-shooting 13
int c = 0;
for (int i = 1; i < 1_000_000; i++) {
if (primeDigitsSum13(i)) {
writef("%6d ", i);
if (c++ == 10) {
c = 0;
writeln;
}
}
}
writeln;
}</lang>
{{out}}
<pre> 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>
 
=={{header|F_Sharp|F#}}==
Line 202 ⟶ 242:
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>
 
=={{header|Factor}}==
===Filtering selections===
1,452

edits