Numbers divisible by their individual digits, but not by the product of their digits.: Difference between revisions
Content added Content deleted
(Add Plain English) |
|||
Line 755: | Line 755: | ||
936 |
936 |
||
999</pre> |
999</pre> |
||
=={{header|Nim}}== |
|||
<lang Nim>import strutils |
|||
iterator digits(n: Positive): int = |
|||
var n = n.int |
|||
while n != 0: |
|||
yield n mod 10 |
|||
n = n div 10 |
|||
var result: seq[int] |
|||
for n in 1..1000: |
|||
block check: |
|||
var m = 1 |
|||
for d in n.digits: |
|||
if d == 0 or n mod d != 0: break check |
|||
m *= d |
|||
if n mod m != 0: result.add n |
|||
echo "Found ", result.len, " matching numbers." |
|||
for i, n in result: |
|||
stdout.write ($n).align(3), if (i + 1) mod 9 == 0: '\n' else: ' '</lang> |
|||
{{out}} |
|||
<pre>Found 45 matching numbers. |
|||
22 33 44 48 55 66 77 88 99 |
|||
122 124 126 155 162 168 184 222 244 |
|||
248 264 288 324 333 336 366 396 412 |
|||
424 444 448 488 515 555 636 648 666 |
|||
728 777 784 824 848 864 888 936 999</pre> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |