Minimum multiple of m where digital sum equals m: Difference between revisions

 

Generate the sequence '''a(n)''' when each element is the minimum integer multiple '''m''' such that the digit sum of '''n''' times '''m''' is equal to '''n'''.

 

 

 

=={{header|ALGOL 68}}==

# returns the digit sum of n, n must be >= 0 #

OP DIGITSUM = ( INT n )INT:

OD

OD

{{out}}

<pre>

</pre>

 

 

=={{header|APL}}==

{{works with|Dyalog APL}}

{{out}}

<pre> 1 1 1 1 1 1 1 1 1 19

17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333

163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857</pre>

 

=={{header|BASIC}}==

==={{header|BASIC256}}===

n = 1

while c < 70

n += 1

end while

{{out}}

 

==={{header|FreeBASIC}}===

{{trans|Phix}}

 

Dim As Integer c = 0, n = 1

n += 1

Loop

{{out}}

<pre> 1 1 1 1 1 1 1 1 1 19

17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333

163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857</pre>

 

==={{header|Yabasic}}===

n = 1

while c < 70

n = n + 1

wend

{{out}}

 

=={{header|C}}==

 

unsigned digit_sum(unsigned n) {

}

return 0;

{{out}}

<pre> 1 1 1 1 1 1 1 1 1 19

 

=={{header|C++}}==

#include <iostream>

 

}

}

 

{{out}}

 

=={{header|CLU}}==

sum: int := 0

while n > 0 do

if n // 10 = 0 then stream$putl(po, "") end

end

{{out}}

<pre> 1 1 1 1 1 1 1 1 1 19

 

=={{header|COBOL}}==

PROGRAM-ID. A131382.

ADD-DIGIT.

{{out}}

<pre style='height:50ex;'>A( 1) = 1

 

=={{header|Cowgol}}==

 

sub digit_sum(n: uint32): (sum: uint8) is

end if;

n := n + 1;

{{out}}

<pre>1 1 1 1 1 1 1 1 1 19

 

=={{header|Draco}}==

* on a real 8-bit micro I'd recommend setting this back to 40;

* it does, however, eventually get there */

if (n & 7) = 0 then writeln() fi

od

{{out}}

<pre> 1 1 1 1 1 1 1 1

103507 154981 150661 1333333 163918 322579 315873 937342

1076923 1030303 880597 1469116 1157971 12842857</pre>

 

=={{header|Forth}}==

{{works with|Gforth}}

dup 10 < if exit then

10 /mod recurse + ;

 

70 main

 

{{out}}

17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333

163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857

</pre>

 

=={{header|Haskell}}==

import Data.List (elemIndex, intercalate, transpose)

import Data.List.Split (chunksOf)

let ws = maximum . fmap length <$> transpose rows

pw = printf . flip intercalate ["%", "s"] . show

{{Out}}

<pre> 1 1 1 1 1 1 1 1 1 19

Implementation:

 

findfirst=: {{

($:@((+1+i.@+:)@#)@[`(+&{. I.)@.(1 e. ]) u) ,1

A131382=: {{y&{{x = sumdigits x*y}} findfirst}}"0

 

 

Task example:

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

 

Stretch example:

4339 2119 2323 10909 11111 12826 14617 14581 16102 199999

17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333

 

=={{header|Julia}}==

 

for j in 1:70

print(lpad(minproddigsum(j), 10), j % 7 == 0 ? "\n" : "")

end

<pre>

1 1 1 1 1 1 1

 

=={{header|MAD}}==

VECTOR VALUES FMT = $2HA(,I2,4H) = ,I8*$

TRANSFER TO DIGIT

END OF FUNCTION

{{out}}

<pre style='height:50ex;'>A( 1) = 1

A(69) = 1157971

A(70) = 12842857</pre>

 

=={{header|Pascal}}==

==={{header|Free Pascal}}===

Constructing minimal start number with sum of digits = m -> k+9+9+9+9+9+9 <BR>

//Like https://oeis.org/A131382/b131382.txt

{$IFDEF FPC} {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$ENDIF}

const

BASE = 10;

BASE4 = BASE*BASE*BASE*BASE;

var

SoD: array[0..BASE4-1] of byte;

procedure Init_SoD;

begin

i := 0;

For i := 1 to Base*Base-1 do

begin

SoD[j] := SoD[i]+d1+d0;

inc(j);

end;

 

var

begin

begin

end;

 

var

i : NativeInt;

m,n: NativeUint;

Begin

Init_SoD;

begin

begin

if m mod 10 = 0 then

writeln;

{{out|@TIO.RUN}}

<pre>

 

 

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Minimum_multiple_of_m_where_digital_sum_equals_m

$m;

} 1 .. 70;

{{out}}

<pre>

=={{header|Phix}}==

{{trans|XPL0}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #004080;">integer</span> <span style="color: #000000;">c</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">0</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">n</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">1</span>

<span style="color: #000000;">n</span> <span style="color: #0000FF;">+=</span> <span style="color: #000000;">1</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">while</span>

{{out}}

<pre>

17449 38269 56413 37037 1108909 142498 103507 154981 150661 1333333

163918 322579 315873 937342 1076923 1030303 880597 1469116 1157971 12842857

</pre>

 

=={{header|Prolog}}==

{{works with|SWI Prolog}}

between(1, 40, N),

min_mult_dsum(N, M),

divmod(N, 10, M, Digit),

S2 is S1 + Digit,

 

{{out}}

 

=={{header|Python}}==

 

from itertools import count, islice

# MAIN ---

if __name__ == '__main__':

{{Out}}

<pre> 1 1 1 1 1 1 1 1 1 19

=={{header|Raku}}==

 

 

{{out}}

<pre> 1: 1

69: 1157971

70: 12842857</pre>

 

=={{header|Wren}}==

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "./seq" for Lst

import "./fmt" for Fmt

res.add(m)

}

 

{{out}}

 

=={{header|XPL0}}==

int N, S;

[S:= 0;

N:= N+1;

until C >= 40+30;

 

{{out}}