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

m
→‎{{header|Pascal}}: comment modified
(→‎{{header|Phix}}: added Pascal only counting)
m (→‎{{header|Pascal}}: comment modified)
Line 764:
 
function CalcPermCount:NativeUint;
//permcountTempDgtCnt[0] = n!3 and /(TempDgtCnt[0]!*TempDgtCnt[1..3]!*TempDgtCnt[= 2]!*TempDgtCnt[ -> dgtcnt = 3]!);+3*2= 9
//TempDgtCnt[0]permcount = 3 anddgtcnt! /(TempDgtCnt[0]!*TempDgtCnt[1..3]= !*TempDgtCnt[2 -dgtcnt = ]!*TempDgtCnt[3+3*2= 9]!);
 
//nom = 1,2,3, 4,5,6,7,8,9
//denom = 1,2,3, 1,2,1,2,1,2
Line 888 ⟶ 889:
real 0m0,003s
</pre>
 
=={{header|Phix}}==
<lang Phix>function unlucky(sequence set, integer needed, string v="", sequence res={})
Anonymous user