Minimum multiple of m where digital sum equals m: Difference between revisions
Content added Content deleted
(RPL: add section) |
(Jakt) |
||
Line 700: | Line 700: | ||
17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333 |
17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333 |
||
163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857</syntaxhighlight> |
163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857</syntaxhighlight> |
||
=={{header|Jakt}}== |
|||
Output format follows the C++ solution with a small difference in the leading whitespace. |
|||
<syntaxhighlight lang="jakt"> |
|||
fn digital_sum(anon n: i64, accumulator: i64 = 0) -> i64 => match n { |
|||
0 => accumulator |
|||
else => digital_sum(n: n / 10, accumulator: accumulator + n % 10) |
|||
} |
|||
fn main() { |
|||
for n in 1..71 { |
|||
for m in (1..) { |
|||
if digital_sum(n * m) == n { |
|||
print("{: 9}", m) |
|||
if n % 10 == 0 { |
|||
println() |
|||
} |
|||
break |
|||
} |
|||
} |
|||
} |
|||
} |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
1 1 1 1 1 1 1 1 1 19 |
|||
19 4 19 19 13 28 28 11 46 199 |
|||
19 109 73 37 199 73 37 271 172 1333 |
|||
289 559 1303 847 1657 833 1027 1576 1282 17497 |
|||
4339 2119 2323 10909 11111 12826 14617 14581 16102 199999 |
|||
17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333 |
|||
163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857 |
|||
</pre> |
|||
=={{header|Julia}}== |
=={{header|Julia}}== |