Sum of the digits of n is substring of n: Difference between revisions

Added Sidef
(Added Fōrmulæ solution)
(Added Sidef)
Line 1,377:
Found 48 numbers
done...
</pre>
 
=={{header|Sidef}}==
<lang ruby>var upto = 1000
var base = 10
 
var list = (^upto -> grep {
.digits(base).contains(.sumdigits(base).digits(base)...)
})
 
say "Numbers under #{upto} whose sum of digits is a substring of themselves:"
 
list.each_slice(8, {|*a|
say a.map { '%3s' % _ }.join(' ')
})
 
say "\n#{list.len} such numbers found."</lang>
{{out}}
<pre>
Numbers under 1000 whose sum of digits is a substring of themselves:
0 1 2 3 4 5 6 7
8 9 10 20 30 40 50 60
70 80 90 100 109 119 129 139
149 159 169 179 189 199 200 300
400 500 600 700 800 900 910 911
912 913 914 915 916 917 918 919
 
48 such numbers found.
</pre>
 
2,747

edits