Anonymous user
Numbers with prime digits whose sum is 13: Difference between revisions
Numbers with prime digits whose sum is 13 (view source)
Revision as of 10:37, 29 October 2020
, 3 years ago→{{header|Go}}: added version for counting after sum 103 must use BIGINT
(Added C++ entry, translation of C# alternate version) |
m (→{{header|Go}}: added version for counting after sum 103 must use BIGINT) |
||
Line 224:
[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>
===only counting===
See Julia [http://rosettacode.org/wiki/Numbers_with_prime_digits_whose_sum_is_13#Julia]
<lang go>
package main
import (
"fmt"
)
var
Primes = []byte{2, 3, 5, 7};
var
gblCount = 0;
var
PrimesIdx = []byte{0, 1, 2, 3};
func combrep(n int, lst []byte) [][]byte {
if n == 0 {
return [][]byte{nil}
}
if len(lst) == 0 {
return nil
}
r := combrep(n, lst[1:])
for _, x := range combrep(n-1, lst) {
r = append(r, append(x, lst[0]))
}
return r
}
func Count(rep []byte)int {
var PrimCount [4]int
for i := 0; i < len(PrimCount); i++ {
PrimCount[i] = 0;
}
//get the count of every item
for i := 0; i < len(rep); i++ {
PrimCount[rep[i]]++
}
var numfac int = len(rep)
var numerator,denominator[]int
for i := 1; i <= len(rep); i++ {
numerator = append(numerator,i) // factors 1,2,3,4. n
denominator = append(denominator,1)
}
numfac = 0; //idx in denominator
for i := 0; i < len(PrimCount); i++ {
denfac := 1;
for j := 0; j < PrimCount[i]; j++ {
denominator[numfac] = denfac
denfac++
numfac++
}
}
//calculate permutations with identical items
numfac = 1;
for i := 0; i < len(numerator); i++ {
numfac = (numfac * numerator[i])/denominator[i]
}
return numfac
}
func main() {
for mySum := 2; mySum <= 103;mySum++ {
gblCount = 0;
//check for prime
for i := 2; i*i <= mySum;i++{
if mySum%i == 0 {
gblCount=1;
break
}
}
if gblCount != 0 {
continue
}
for n := 1; n <= mySum / 2 ; n++ {
reps := combrep(n, PrimesIdx)
for _, rep := range reps {
sum := byte(0)
for _, r := range rep {
sum += Primes[r]
}
if sum == byte(mySum) {
gblCount+=Count(rep);
}
}
}
fmt.Println("The count of numbers whose digits are all prime and sum to",mySum,"is",gblCount)
}
}</lang>
{{out}}
<pre>
The count of numbers whose digits are all prime and sum to 2 is 1
The count of numbers whose digits are all prime and sum to 3 is 1
The count of numbers whose digits are all prime and sum to 5 is 3
The count of numbers whose digits are all prime and sum to 7 is 6
The count of numbers whose digits are all prime and sum to 11 is 19
The count of numbers whose digits are all prime and sum to 13 is 43
The count of numbers whose digits are all prime and sum to 17 is 221
The count of numbers whose digits are all prime and sum to 19 is 468
The count of numbers whose digits are all prime and sum to 23 is 2098
The count of numbers whose digits are all prime and sum to 29 is 21049
The count of numbers whose digits are all prime and sum to 31 is 45148
The count of numbers whose digits are all prime and sum to 37 is 446635
The count of numbers whose digits are all prime and sum to 41 is 2061697
The count of numbers whose digits are all prime and sum to 43 is 4427752
The count of numbers whose digits are all prime and sum to 47 is 20424241
The count of numbers whose digits are all prime and sum to 53 is 202405001
The count of numbers whose digits are all prime and sum to 59 is 2005642061
The count of numbers whose digits are all prime and sum to 61 is 4307930784
The count of numbers whose digits are all prime and sum to 67 is 42688517778
The count of numbers whose digits are all prime and sum to 71 is 196942068394
The count of numbers whose digits are all prime and sum to 73 is 423011795680
The count of numbers whose digits are all prime and sum to 79 is 4191737820642
The count of numbers whose digits are all prime and sum to 83 is 19338456915087
The count of numbers whose digits are all prime and sum to 89 is 191629965405641
The count of numbers whose digits are all prime and sum to 97 is 4078672831913824
The count of numbers whose digits are all prime and sum to 101 is 18816835854129198
The count of numbers whose digits are all prime and sum to 103 is 40416663565084464
real 0m4,489s
user 0m5,584s
sys 0m0,188s</pre>
=={{header|Haskell}}==
| |||