Numbers with prime digits whose sum is 13: Difference between revisions
Numbers with prime digits whose sum is 13 (view source)
Revision as of 16:57, 25 January 2023
, 1 year agoalready break when equal
(J) |
(already break when equal) |
||
Line 1,352:
=={{header|OCaml}}==
<syntaxhighlight lang="ocaml">let
let digits = [2; 3; 5; 7] in
let rec
| (n, r) :: cs' as cs ->▼
▲ | [] -> if ns = [] then Seq.Nil else loop digits (List.rev ns) [] ()
▲ | (n, r) :: cs' ->
match ds with
| d :: ds' when d < r ->
| d :: ds' when d = r ->
| _ ->
in
let () =
{{out}}
<pre>
=={{header|Pascal}}==
Line 1,937 ⟶ 1,936:
r, n = src.pop(0)
for d in 2, 3, 5, 7:
if d >= r:
break
▲ dst.append(n * 10 + d)
▲ src.append((r - d, n * 10 + d))
print(*dst)</syntaxhighlight>
{{out}}
Line 2,115 ⟶ 2,113:
set src [lassign $src n r]
foreach d {2 3 5 7} {
if {$d >= $r}
if {$d == $r} {lappend res "$n$d"}
lappend src "$n$d" [expr {$r - $d}]▼
}
}
}
Line 2,134 ⟶ 2,131:
for d in 2 3 5 7
do
[ $d -
done
shift 2
|