Minimum positive multiple in base 10 using only 0 and 1: Difference between revisions

m
→‎{{header|Phix}}: clarified inner test
(→‎{{header|Dc}}: really is Tcl, not Dc; sorry)
m (→‎{{header|Phix}}: clarified inner test)
Line 911:
val[x+1] = ten
for j=1 to NUM do
integerif kpow[j] and pow[j]!=x then -- mod(j-1+ten seen,n in a prior iteration)+1
if pow[j] and not pow[integer k] and= pow[mod(j]!=x then-1+ten,n)+1
if not pow[k]=x then
pow[k]=x -- (k was seen in this iteration)
end if
end if
end for
7,818

edits