First, some assumptions:
- Numbers means natural numbers
- Digits means digits in the decimal representation
- Divisible by a digit means divisible without remainder
- The digit 0 is excluded, since division by 0 is undefined
There are 9 different digits allowed, and any number having more than 9 digits will necessarily have some digits repeated. So, the upper bound is 987,654,321.
#! perl
use Modern::Perl;
my $count = 0;
OUTER:
for my $n (1 .. 987_654_321)
{
my %digits;
++$digits{$_} for split //, $n;
for (keys %digits)
{
next OUTER if ($_ == 0) || ($digits{$_} > 1) || ($n % $_);
}
printf "#%d is %d\n", ++$count, $n;
}
Hope that helps,
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|