Minimum multiple of m where digital sum equals m: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add SETL) |
(Added Easylang) |
||
| Line 579: | Line 579: | ||
163918 322579 315873 937342 1076923 1030303 880597 1469116 115797112842857 |
163918 322579 315873 937342 1076923 1030303 880597 1469116 115797112842857 |
||
</pre> |
</pre> |
||
=={{header|EasyLang}}== |
|||
{{trans|AWK}} |
|||
<syntaxhighlight> |
|||
fastfunc digsum n . |
|||
while n > 0 |
|||
sum += n mod 10 |
|||
n = n div 10 |
|||
. |
|||
return sum |
|||
. |
|||
for n = 1 to 70 |
|||
m = 1 |
|||
while digsum (m * n) <> n |
|||
m += 1 |
|||
. |
|||
write m & " " |
|||
. |
|||
</syntaxhighlight> |
|||
| Line 602: | Line 622: | ||
163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857 |
163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857 |
||
</pre> |
</pre> |
||
=={{header|FOCAL}}== |
=={{header|FOCAL}}== |
||
<syntaxhighlight lang="focal">01.10 F N=1,40;D 2 |
<syntaxhighlight lang="focal">01.10 F N=1,40;D 2 |
||