blocks|key|1113580|text|哈斯克尔，20字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1113581|n%25b=until(>n)(*b)1-n|code-block|syntax|javascript|1113582|在网上试试！|unstyled|1113583|until拯救了这一天|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##FYoxDsIwEAS/cgWRbLQUPp9NXIRvUKAUiYQUC3OKwDR83hhNs7OabXk/7qW0psM6fbTmYi5qzXG17qTtuWSlifZX1koH@ub9mutGZrB0Y8cI0UOSg7BAYoIXj5AYPCbEJPD957m3CB2PEefOf3Wf2w8^0|0|4|0|0|0|0|6|1|0|0|5^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://www.haskell.org/" rel="nofollow noreferrer">Haskell</a>, 20 bytes</h1>



<pre class="lang-hs prettyprint-override"><code>n%b=until(&gt;n)(*b)1-n
</code></pre>

<p><a href="https://tio.run/##FYoxDsIwEAS/cgWRbLQUPp9NXIRvUKAUiYQUC3OKwDR83hhNs7OabXk/7qW0psM6fbTmYi5qzXG17qTtuWSlifZX1koH@ub9mutGZrB0Y8cI0UOSg7BAYoIXj5AYPCbEJPD957m3CB2PEefOf3Wf2w8" rel="nofollow noreferrer" title="Haskell – Try It Online">Try it online!</a></p>

<p><code>until</code> saves the day</p>


blocks|key|1113631|text|R，30字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1113632|pryr::f(b%5Efloor(log(n,b)%2B1)-n)|code-block|syntax|javascript|1113633|计算结果为函数|unstyled|1113634|function+(b,+n)+
b%5Efloor(log(n,+b)+%2B+1)+-+n|1113635|它获取大于或等于n的第一个幂，然后从该值减去n。|offset|length|style|CODE|1113636|将ceiling(power)改为floor(power%2B1)，以确保如果n是b的一个幂，则使用下一个幂。|entityMap^0|0|0|0|0|8|1|M|1|0|1|E|H|E|11|1|13|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|Y|8|@$N|Z|O|10|P|Q]|$N|11|O|12|P|Q]]|9|@]|A|$]]|$1|R|3|S|5|I|7|13|8|@$N|14|O|15|P|Q]|$N|16|O|17|P|Q]|$N|18|O|19|P|Q]|$N|1A|O|1B|P|Q]]|9|@]|A|$]]]|T|$]]

<h1>R, 30 bytes</h1>

<pre><code>pryr::f(b^floor(log(n,b)+1)-n)
</code></pre>

<p>Evaluates to the function</p>

<pre><code>function (b, n) 
b^floor(log(n, b) + 1) - n
</code></pre>

<p>Which takes the first power greater or equal than <code>n</code>, and then substracts <code>n</code> from that value.</p>

<p>Changed <code>ceiling(power)</code> to <code>floor(power+1)</code> to ensure that if <code>n</code> is a power of <code>b</code>, we take the next power.</p>


blocks|key|6536477|text|Mathematica，24字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6536478|#2%5E⌊1/#~Log~#2⌋#2-#&|code-block|syntax|javascript|6536479|谢谢马丁|unstyled|6536480|I/O|6536481|343，7+2058|blockquote|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Q|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|R|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|S|8|@]|9|@]|A|$]]|$1|L|3|M|5|N|7|T|8|@]|9|@]|A|$]]]|O|$]]

<h1>Mathematica, 24 bytes</h1>
<pre><code>#2^⌊1/#~Log~#2⌋#2-#&amp;
</code></pre>
<p>thanks Martin</p>
<p><strong>I/O</strong></p>
<blockquote>
<p>[343, 7]</p>
<p>2058</p>
</blockquote>


blocks|key|1113014|text|Java+(OpenJDK+8)，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1113015|基于@GovindParmar的C回答。|unstyled|1113016|n->b->{for(int+o=b;n>=b;b*=o);return+b-n;}|code-block|syntax|javascript|1113017|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://openjdk.java.net/|1|https://codegolf.stackexchange.com/a/127227/58217|2|https://tio.run/##lZAxb4MwEIX3/IoboSqWAoQGuTBW6tApY9XBEEAmcLbMESmK@O3UlXAydIEbfKdnf372a8VVBEpX2J4vs@y1MgSt1dhIsmP1iCVJhexjGfhOj0UnSyg7MQzwJSTCfQe2Fn0gQbZdlTxDb3e9ExmJzfcPCNMM/nL4r9yV759IVVOZ13/C0vMcashgxiAvgvxeK@NJJFBZwTG3S/GSKZ@bikaDUATIp9l58Ifb6TZQ1TM1EtP2QdShVzOhdXfzwn3ou9H3OaxhDknkmMNaJk7325kwdky0mklSxxzXMlH8@M/b6gzScDMTHtPNGSTp9gyiZ25Pn2k3zb8^0|0|G|0|0|2|H|1|0|0|0|6|2^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|G|3|H|5|I|7|16|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]|W|$5|P|Q|R|C|$S|X]]]]

<h1><a href="http://openjdk.java.net/" rel="nofollow noreferrer">Java (OpenJDK 8)</a>, 42 bytes</h1>

<p><em>Based on <a href="https://codegolf.stackexchange.com/a/127227/58217">@GovindParmar's C answer</a>.</em></p>



<pre class="lang-java prettyprint-override"><code>n-&gt;b-&gt;{for(int o=b;n&gt;=b;b*=o);return b-n;}
</code></pre>

<p><a href="https://tio.run/##lZAxb4MwEIX3/IoboSqWAoQGuTBW6tApY9XBEEAmcLbMESmK@O3UlXAydIEbfKdnf372a8VVBEpX2J4vs@y1MgSt1dhIsmP1iCVJhexjGfhOj0UnSyg7MQzwJSTCfQe2Fn0gQbZdlTxDb3e9ExmJzfcPCNMM/nL4r9yV759IVVOZ13/C0vMcashgxiAvgvxeK@NJJFBZwTG3S/GSKZ@bikaDUATIp9l58Ifb6TZQ1TM1EtP2QdShVzOhdXfzwn3ou9H3OaxhDknkmMNaJk7325kwdky0mklSxxzXMlH8@M/b6gzScDMTHtPNGSTp9gyiZ25Pn2k3zb8" rel="nofollow noreferrer" title="Java (OpenJDK 8) – Try It Online">Try it online!</a></p>


blocks|key|1113122|text|JavaScript+(ES6)，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1113123|非常类似于里克法，但在他的许可下发布(还有一些帮助保存一个字节)。|unstyled|offset|length|1113124|n=>b=>g=(x=b)=>x>n?x-n:g(x*b)|code-block|syntax|javascript|1113125|试试看|1113126|f=
n=>b=>g=(x=b)=>x>n?x-n:g(x*b)
oninput=_=>o.value=f(%2Bi.value)(%2Bj.value)()
o.value=f(i.value=324)(j.value=5)()|1113127|*{font-family:sans-serif;}
input{margin:0+5px+0+0;width:50px;}|1113128|<label+for=i>n:+</label><input+id=i+type=number><label+for=j>b:+</label><input+id=j+type=number><label+for=o>=+</label><input+id=o>|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/127232/58974^0|0|5|3|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@$E|12|F|13|1|14]]|A|$]]|$1|G|3|H|5|I|7|15|8|@]|9|@]|A|$J|K]]|$1|L|3|M|5|6|7|16|8|@]|9|@]|A|$]]|$1|N|3|O|5|I|7|17|8|@]|9|@]|A|$J|K]]|$1|P|3|Q|5|I|7|18|8|@]|9|@]|A|$J|K]]|$1|R|3|S|5|I|7|19|8|@]|9|@]|A|$J|K]]]|T|$U|$5|V|W|X|A|$Y|Z]]]]

<h1>JavaScript (ES6), 29 bytes</h1>
<p>Very similar to <a href="https://codegolf.stackexchange.com/a/127232/58974">Rick's approach</a> but posted with his permission (and some help saving a byte).</p>
<pre><code>n=&gt;b=&gt;g=(x=b)=&gt;x&gt;n?x-n:g(x*b)
</code></pre>
<hr />
<h2>Try it</h2>
<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>f=
n=&gt;b=&gt;g=(x=b)=&gt;x&gt;n?x-n:g(x*b)
oninput=_=&gt;o.value=f(+i.value)(+j.value)()
o.value=f(i.value=324)(j.value=5)()</code></pre>
<pre class="snippet-code-css lang-css prettyprint-override"><code>*{font-family:sans-serif;}
input{margin:0 5px 0 0;width:50px;}</code></pre>
<pre class="snippet-code-html lang-html prettyprint-override"><code>&lt;label for=i&gt;n: &lt;/label&gt;&lt;input id=i type=number&gt;&lt;label for=j&gt;b: &lt;/label&gt;&lt;input id=j type=number&gt;&lt;label for=o&gt;= &lt;/label&gt;&lt;input id=o&gt;</code></pre>
</div>
</div>
</p>


blocks|key|1114063|text|维沙尔，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1114064|ɾe'¹>;hε|code-block|syntax|javascript|1114065|在网上试试！|unstyled|1114066|05AB1E港|1114067|怎么做？|1114068|ɾe'¹>;hε
ɾ++++++++#+Inclusive+range+from+one+to+(implicit)+first+input
+e+++++++#+For+each+element,+push+it+to+the+power+of+the+(implicit)+second+input
++'¹>;+++#+Filter+for+only+elements+greater+than+the+first+input
++++++h++#+Get+the+first+item
+++++++ε+#+Get+the+absolute+difference+of+the+first+item+and+the+(implicit)+first+input|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://vyxal.pythonanywhere.com/#WyIiLCIiLCLJvmUnwrk%2BO2jOtSIsIiIsIjM0M1xuNyJd^0|0|3|0|0|0|0|6|1|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1A|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1B|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a>, 8 bytes</h1>
<pre><code>ɾe'¹&gt;;hε
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyIiLCIiLCLJvmUnwrk+O2jOtSIsIiIsIjM0M1xuNyJd" rel="nofollow noreferrer">Try it Online!</a></p>
<p>Port of 05AB1E.</p>
<h2>How?</h2>
<pre><code>ɾe'¹&gt;;hε
ɾ        # Inclusive range from one to (implicit) first input
 e       # For each element, push it to the power of the (implicit) second input
  '¹&gt;;   # Filter for only elements greater than the first input
      h  # Get the first item
       ε # Get the absolute difference of the first item and the (implicit) first input
</code></pre>


blocks|key|6536543|text|JavaScript+(ES6)，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6536544|f=(n,b,i=b)=>b>n?b-n:f(n,b*i,i)|code-block|syntax|javascript|6536545|测试用例：|6536546|f=(n,b,i=b)=>b>n?b-n:f(n,b*i,i)

console.log(f(212,+2))+//+44
console.log(f(563,+5))+//+62
console.log(f(491,+5))+//+134
console.log(f(424,+3))+//+305
console.log(f(469,+8))+//+43
console.log(f(343,+7))+//+2058
console.log(f(592,+7))+//+1809
console.log(f(289,+5))+//+336
console.log(f(694,+3))+//+35
console.log(f(324,+5))+//+301|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|M|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|N|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|O|8|@]|9|@]|A|$E|F]]]|K|$]]

<h1>JavaScript (ES6), 31 bytes</h1>
<pre><code>f=(n,b,i=b)=&gt;b&gt;n?b-n:f(n,b*i,i)
</code></pre>
<p><strong>Test cases:</strong></p>
<p><div class="snippet" data-lang="js" data-hide="true" data-console="true" data-babel="false">
<div class="snippet-code snippet-currently-hidden">
<pre class="snippet-code-js lang-js prettyprint-override"><code>f=(n,b,i=b)=&gt;b&gt;n?b-n:f(n,b*i,i)

console.log(f(212, 2)) // 44
console.log(f(563, 5)) // 62
console.log(f(491, 5)) // 134
console.log(f(424, 3)) // 305
console.log(f(469, 8)) // 43
console.log(f(343, 7)) // 2058
console.log(f(592, 7)) // 1809
console.log(f(289, 5)) // 336
console.log(f(694, 3)) // 35
console.log(f(324, 5)) // 301</code></pre>
</div>
</div>
</p>


blocks|key|6536578|text|八度，32字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6536579|@(n,b)b%5E(fix(log(n)/log(b))%2B1)-n|code-block|syntax|javascript|6536580|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/octave/|1|https://tio.run/##y08uSSxL/Z9mq6en999BI08nSTMpTiMts0IjJz9dI09TH0QlaWpqG2rq5v1P0zAyNNIx0uRK0zA2MtEx1fwPAA^0|0|2|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.gnu.org/software/octave/" rel="nofollow noreferrer">Octave</a>, 32 bytes</h1>



<pre class="lang-matlab prettyprint-override"><code>@(n,b)b^(fix(log(n)/log(b))+1)-n
</code></pre>

<p><a href="https://tio.run/##y08uSSxL/Z9mq6en999BI08nSTMpTiMts0IjJz9dI09TH0QlaWpqG2rq5v1P0zAyNNIx0uRK0zA2MtEx1fwPAA" rel="nofollow noreferrer" title="Octave – Try It Online">Try it online!</a></p>


blocks|key|6536645|text|倍频程，26字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6536646|@(n,b)b%5Esum(b.%5E(0:n)<=n)-n|code-block|syntax|javascript|6536647|验证所有测试用例！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##JU3JqsIwFF17vuJuCgnUktybxEYt@B@PJ1hrwYWpWAfoz9cGV2fgDMP5eXpf5vmgUtnq9ji@bqqtjspsk943Sa/T3DenNO6AqfmrqgpsmZgK5@CDkKciMFy0mVlxcOxIqBDj4UKkekkKxAltqGDja/jImdvaRHAdc08kIMRfz0OWhWwaC1qe/P9uEQD64UEdNWS39Bg@o5o0Vt11vKteTaorrS4zsNYal9TNXw^0|0|0|0|9|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Octave, 26 bytes</h1>

<pre class="lang-matlab prettyprint-override"><code>@(n,b)b^sum(b.^(0:n)&lt;=n)-n
</code></pre>
<p><a href="https://tio.run/##JU3JqsIwFF17vuJuCgnUktybxEYt@B@PJ1hrwYWpWAfoz9cGV2fgDMP5eXpf5vmgUtnq9ji@bqqtjspsk943Sa/T3DenNO6AqfmrqgpsmZgK5@CDkKciMFy0mVlxcOxIqBDj4UKkekkKxAltqGDja/jImdvaRHAdc08kIMRfz0OWhWwaC1qe/P9uEQD64UEdNWS39Bg@o5o0Vt11vKteTaorrS4zsNYal9TNXw" rel="nofollow noreferrer" title="Octave – Try It Online">Verify all test cases!</a></p>


blocks|key|1113381|text|红宝石，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1113382|有两种不同的办法：|unstyled|1113383|->(n,b){p+b**(Math.log(n,b).to_i%2B1)-n}|code-block|syntax|javascript|1113384|在网上试试！|1113385|->(n,b){p+b**(0..n).find{%7Cx%7Cb**x>n}-n}|1113386|entityMap|0|LINK|mutability|MUTABLE|url|https://www.ruby-lang.org/|1|https://tio.run/##KypNqvyfZvtf104jTydJs7pAIUlLS8M3sSRDLyc/HSymV5Ifn6ltqKmbV/s/TS85MSdHw8jQSMdIkwvKMzUz1jGF80wsDZF5RiY6xgiemaWOBZxnbGKsY44wxdIIiWdkYYlkipklsinGQDMRckZA9n8A|2|https://tio.run/##KypNqvyfZvtf104jTydJs7pAIUlLS8NATy9PUy8tMy@luqaiBihSYZdXq5tX@z9NLzkxJ0fDyNBIx0iTC8ozNTPWMYXzTCwNkXlGJjrGCJ6ZpY4FnGdsYqxjjjDF0giJZ2RhiWSKmSWyKcZAMxFyRkD2fwA^0|0|3|0|0|0|0|0|6|1|0|0|0|6|2^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|D|3|E|5|F|7|15|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|16|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|N|3|O|5|I|7|1B|8|@]|9|@]|C|$J|K]]|$1|P|3|M|5|F|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]]|Q|$R|$5|S|T|U|C|$V|W]]|X|$5|S|T|U|C|$V|Y]]|Z|$5|S|T|U|C|$V|10]]]]

<h1><a href="https://www.ruby-lang.org/" rel="nofollow noreferrer">Ruby</a>, 38 bytes</h1>

<p>Two different approaches:</p>



<pre class="lang-ruby prettyprint-override"><code>-&gt;(n,b){p b**(Math.log(n,b).to_i+1)-n}
</code></pre>

<p><a href="https://tio.run/##KypNqvyfZvtf104jTydJs7pAIUlLS8M3sSRDLyc/HSymV5Ifn6ltqKmbV/s/TS85MSdHw8jQSMdIkwvKMzUz1jGF80wsDZF5RiY6xgiemaWOBZxnbGKsY44wxdIIiWdkYYlkipklsinGQDMRckZA9n8A" rel="nofollow noreferrer" title="Ruby – Try It Online">Try it online!</a></p>

<pre class="lang-ruby prettyprint-override"><code>-&gt;(n,b){p b**(0..n).find{|x|b**x&gt;n}-n}
</code></pre>

<p><a href="https://tio.run/##KypNqvyfZvtf104jTydJs7pAIUlLS8NATy9PUy8tMy@luqaiBihSYZdXq5tX@z9NLzkxJ0fDyNBIx0iTC8ozNTPWMYXzTCwNkXlGJjrGCJ6ZpY4FnGdsYqxjjjDF0giJZ2RhiWSKmSWyKcZAMxFyRkD2fwA" rel="nofollow noreferrer" title="Ruby – Try It Online">Try it online!</a></p>


blocks|key|6536725|text|杰夫特，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6536726|_q}a@nVpX|code-block|syntax|javascript|6536727|在线测试！|unstyled|6536728|解释|6536729|_++q}a@++nVpX
Z{Zq}aX{UnVpX}++//+Ungolfed
++++++++++++++++//+Implicit:+U,+V+=+input+integers
+++++aX{+++++}++//+For+each+integer+X+in+[0...1e9),+take
++++++++++VpX+++//+++V+to+the+power+of+X
++++++++Un++++++//+++minus+U,
Z{++}+++++++++++//+and+return+the+first+one+Z+where
++Zq++++++++++++//+++Math.sqrt(Z)+is+truthy.
++++++++++++++++//+++Math.sqrt+returns+NaN+for+negative+inputs,+and+0+is+falsy,+so+this+is
++++++++++++++++//+++truthy+iff+Z+is+positive.+Therefore,+this+returns+the+first+positive
++++++++++++++++//+++value+of+V**X+-+U.
++++++++++++++++//+Implicit:+output+result+of+last+expression|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|http://ethproductions.github.io/japt/?v=1.4.5&code=X3F9YUBuVnBY&input=MTI3IDI=^0|0|3|0|0|0|0|5|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 9 bytes</h1>

<pre><code>_q}a@nVpX
</code></pre>

<p><a href="http://ethproductions.github.io/japt/?v=1.4.5&amp;code=X3F9YUBuVnBY&amp;input=MTI3IDI=" rel="nofollow noreferrer">Test it online!</a></p>

<h3>Explanation</h3>

<pre><code>_  q}a@  nVpX
Z{Zq}aX{UnVpX}  // Ungolfed
                // Implicit: U, V = input integers
     aX{     }  // For each integer X in [0...1e9), take
          VpX   //   V to the power of X
        Un      //   minus U,
Z{  }           // and return the first one Z where
  Zq            //   Math.sqrt(Z) is truthy.
                //   Math.sqrt returns NaN for negative inputs, and 0 is falsy, so this is
                //   truthy iff Z is positive. Therefore, this returns the first positive
                //   value of V**X - U.
                // Implicit: output result of last expression
</code></pre>


blocks|key|6536751|text|哈斯克尔，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6536752|f+n+b=[b%5Ex-n%7Cx<-[1..],b%5Ex>n]!!0|code-block|syntax|javascript|6536753|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##FYrhCoIwGEVf5fOfwlXy21wOshcZC2YkjXTISrDo3dfi/LnncO/u@bjNc0oTBRoHM172Onz3U23aprHIeg62KA5pcT7QQGv04UXl4lYqt3DdYnzTVFH58SsZbhmdEpC6hWQJqTSEFOg0g3sNpSVE7mzzF11GoMcx81/ZbVWlHw^0|0|4|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.haskell.org/" rel="nofollow noreferrer">Haskell</a>, 31 bytes</h1>



<pre class="lang-hs prettyprint-override"><code>f n b=[b^x-n|x&lt;-[1..],b^x&gt;n]!!0
</code></pre>

<p><a href="https://tio.run/##FYrhCoIwGEVf5fOfwlXy21wOshcZC2YkjXTISrDo3dfi/LnncO/u@bjNc0oTBRoHM172Onz3U23aprHIeg62KA5pcT7QQGv04UXl4lYqt3DdYnzTVFH58SsZbhmdEpC6hWQJqTSEFOg0g3sNpSVE7mzzF11GoMcx81/ZbVWlHw" rel="nofollow noreferrer" title="Haskell – Try It Online">Try it online!</a></p>


blocks|key|6537016|text|布氏对数，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6537017|%5Eʰ↙X>₁-|code-block|syntax|javascript|6537018|在网上试试！|unstyled|6537019|将输入作为列表[b,+n]。|style|CODE|6537020|++++>₁+++++n+is+strictly+less+than
%5E+↙X+++++++some+power+of
+ʰ+++++++++b,
++++++-++++and+their+difference+is
+++++++++++the+output.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JCumin/Brachylog|1|https://tio.run/##SypKTM6ozMlPN/pf/ahjuVKSgq2CUrl9RrmSjkIehF1SrqSgawdiPWrb8Kip6eGuztqHWyf8jzu14VHbzAi7R02Nuv//RytEG@kYGRrF6kSb6piaGYNpE0tDIG2sY2JkAqQtdEzMLIG0uY6xiTGYNrWEqDeysASrM7M0AfONjSC0UaxCLAA^0|0|4|0|0|0|0|6|1|0|7|6|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@$A|1A|B|1B|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1C|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/JCumin/Brachylog" rel="nofollow noreferrer">Brachylog</a>, 7 bytes</h1>

<pre><code>^ʰ↙X&gt;₁-
</code></pre>

<p><a href="https://tio.run/##SypKTM6ozMlPN/pf/ahjuVKSgq2CUrl9RrmSjkIehF1SrqSgawdiPWrb8Kip6eGuztqHWyf8jzu14VHbzAi7R02Nuv//RytEG@kYGRrF6kSb6piaGYNpE0tDIG2sY2JkAqQtdEzMLIG0uY6xiTGYNrWEqDeysASrM7M0AfONjSC0UaxCLAA" rel="nofollow noreferrer" title="Brachylog – Try It Online">Try it online!</a></p>

<p>Takes input as a list <code>[b, n]</code>.</p>

<pre><code>    &gt;₁     n is strictly less than
^ ↙X       some power of
 ʰ         b,
      -    and their difference is
           the output.
</code></pre>


blocks|key|6537236|text|第四次(痛风)，45字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6537237|:+f+>r+1+begin+i+*+2dup+<+until+rdrop+-+abs+;|code-block|syntax|javascript|6537238|在网上试试！|unstyled|6537239|代码解释|6537240|:+f++++++++++#+start+a+new+word+definition
++>r+++++++++#+store+b+on+the+return+stack+for+quick+access
++1++++++++++#+create+a+counter+to+store+powers+of+b
++begin++++++#+start+an+indefinite+loop
++++i+*++++++#+multiply+the+counter+by+b
++++2+dup+<++#+duplicate+the+counter+and+n.+Check+if+n+is+less+than+the+counter
++until++++++#+if+it+is,+end+the+loop
++rdrop++++++#+remove+b+from+the+return+stack
++-+abs++++++#+subtract+and+get+absolute+value+(avoid+negative)
;++++++++++++#+end+the+word+definition|entityMap|0|LINK|mutability|MUTABLE|url|http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/|1|https://tio.run/##JYxBCoNAEATvvqLwGFBwVo0bg3/RGI0QdFmVPN/M6mWKoat7WPz2ScYh4DgeDDSejO49TjMTN6TfHU/2eZu@@N4vjoS2W6nVdle8/lqHIfVIOGkMSUOsYykvTx1JJhq5qCgNhTK32UXJtacsLZXS5IZ78KyclMqeXmkvz6gffnRNefwB^0|0|7|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/" rel="nofollow noreferrer">Forth (gforth)</a>, 45 bytes</h1>

<pre class="lang-ruby prettyprint-override"><code>: f &gt;r 1 begin i * 2dup &lt; until rdrop - abs ;
</code></pre>
<p><a href="https://tio.run/##JYxBCoNAEATvvqLwGFBwVo0bg3/RGI0QdFmVPN/M6mWKoat7WPz2ScYh4DgeDDSejO49TjMTN6TfHU/2eZu@@N4vjoS2W6nVdle8/lqHIfVIOGkMSUOsYykvTx1JJhq5qCgNhTK32UXJtacsLZXS5IZ78KyclMqeXmkvz6gffnRNefwB" rel="nofollow noreferrer" title="Forth (gforth) – Try It Online">Try it online!</a></p>
<h3>Code Explanation</h3>
<pre class="lang-ruby prettyprint-override"><code>: f          # start a new word definition
  &gt;r         # store b on the return stack for quick access
  1          # create a counter to store powers of b
  begin      # start an indefinite loop
    i *      # multiply the counter by b
    2 dup &lt;  # duplicate the counter and n. Check if n is less than the counter
  until      # if it is, end the loop
  rdrop      # remove b from the return stack
  - abs      # subtract and get absolute value (avoid negative)
;            # end the word definition
</code></pre>


blocks|key|1114239|text|外壳，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1114240|≠Ω>¹*³|code-block|syntax|javascript|1114241|在网上试试！|unstyled|1114242|≠Ω>¹*³++++++#+¹+and+³+duplicate+arguments+⁰+and+²,+so+parses+as:
≠Ω>⁰*²²⁰
++++++++++++#+now:
+Ω>⁰*²²+++++#+Ω+=+Iterate+function+f+until+test+result+t+is+truthy,+starting+with+x:
++++++²+++++#+++++x+is+arg+2
++++*²++++++#+++++f+is+*²+=+times+arg+2,+so+iterating+generates+power+series+of+arg+2
++>⁰++++++++#+++++t+is+>⁰+=+greater+than+arg+1++
++++++++++++#+then:
≠+++++++++++#+get+the+absolute+difference+to
+++++++⁰++++#+arg+1|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/barbuz/Husk|1|https://tio.run/##yygtzv7/cGfjw11dj5oa/z/qXHBupd2hnVqHNv///z862kjHyNAoVifaVMfUzBhMm1gaAmljHRMjEyBtoWNiZgmkzXWMTYxjYwE^0|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/barbuz/Husk" rel="nofollow noreferrer">Husk</a>, 6 bytes</h1>
<pre><code>≠Ω&gt;¹*³
</code></pre>
<p><a href="https://tio.run/##yygtzv7/cGfjw11dj5oa/z/qXHBupd2hnVqHNv///z862kjHyNAoVifaVMfUzBhMm1gaAmljHRMjEyBtoWNiZgmkzXWMTYxjYwE" rel="nofollow noreferrer" title="Husk – Try It Online">Try it online!</a></p>
<pre><code>≠Ω&gt;¹*³      # ¹ and ³ duplicate arguments ⁰ and ², so parses as:
≠Ω&gt;⁰*²²⁰
            # now:
 Ω&gt;⁰*²²     # Ω = Iterate function f until test result t is truthy, starting with x:
      ²     #     x is arg 2
    *²      #     f is *² = times arg 2, so iterating generates power series of arg 2
  &gt;⁰        #     t is &gt;⁰ = greater than arg 1  
            # then:
≠           # get the absolute difference to
       ⁰    # arg 1
</code></pre>


blocks|key|1113245|text|奇比，23字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1113246|{p=:%5Eq~p>:%7C_xp-b%7C\q=q%2B1|code-block|syntax|javascript|1113247|首先接受参数b，然后是n。|unstyled|style|CODE|1113248|解释|1113249|{+++++++DO
p=:%5Eq+++SET+p+to+input+b+(read+as+'a'+by+QBIC+fromt+he+cmd+line)+**+q+(starts+as+1)
~p>:++++IF+p+exceeds+'n'+(read+as+'b'+by+QBIC+fromt+he+cmd+line)
%7C_xp-b%7C+THEN+QUIT,+printing+p+minus+b
\q=q%2B1++ELSE+increase+q,+re-run|entityMap|0|LINK|mutability|MUTABLE|url|https://drive.google.com/drive/folders/0B0R1Jgqp8Gg4cVJCZkRkdEthZDQ^0|0|2|0|0|0|6|1|B|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@$A|14|B|15|L|M]|$A|16|B|17|L|M]]|9|@]|C|$]]|$1|N|3|O|5|6|7|18|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|19|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]]]

<h1><a href="https://drive.google.com/drive/folders/0B0R1Jgqp8Gg4cVJCZkRkdEthZDQ" rel="nofollow noreferrer">QBIC</a>, 23 bytes</h1>
<pre><code>{p=:^q~p&gt;:|_xp-b|\q=q+1
</code></pre>
<p>Takes parameter <code>b</code> first, then <code>n</code>.</p>
<h2>Explanation</h2>
<pre><code>{       DO
p=:^q   SET p to input b (read as 'a' by QBIC fromt he cmd line) ** q (starts as 1)
~p&gt;:    IF p exceeds 'n' (read as 'b' by QBIC fromt he cmd line)
|_xp-b| THEN QUIT, printing p minus b
\q=q+1  ELSE increase q, re-run
</code></pre>


blocks|key|6536621|text|通用Lisp，73字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6536622|(defun+f(n+b)(setq+a+b)(loop(when(>+b+n)(return(-+b+n)))(setq+b(*+b+a))))|code-block|syntax|javascript|6536623|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##XY1BDsIgEEX3nmKWMyYuOlAsG@9SFGKTZootjcdHakwM7Oa9/Ly5z9MWc8aHD7tAQAFHuPn0gvG45mWJ@H56wRs4EMLVp30VvHyJflOH58JjYcoY10kSYADuGJjo9De9UdBXRtuuNaxB1cZYGCqjtIJrXbbcGB5sUza2Lavyq97wwfkD^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Common Lisp, 73 bytes</h1>

<pre><code>(defun f(n b)(setq a b)(loop(when(&gt; b n)(return(- b n)))(setq b(* b a))))
</code></pre>

<p><a href="https://tio.run/##XY1BDsIgEEX3nmKWMyYuOlAsG@9SFGKTZootjcdHakwM7Oa9/Ly5z9MWc8aHD7tAQAFHuPn0gvG45mWJ@H56wRs4EMLVp30VvHyJflOH58JjYcoY10kSYADuGJjo9De9UdBXRtuuNaxB1cZYGCqjtIJrXbbcGB5sUza2Lavyq97wwfkD" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|1113530|text|J，17字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1113531|[-~]%5E[:>.]%5E.[:>:[|code-block|syntax|javascript|1113532|使用|1113533|+++f+=:+[-~]%5E[:>.]%5E.[:>:[
+++424+f+3
305|1113534|解释|1113535|执行pow(b,+ceil(log(n%2B1)))，其中log有基本b。|unstyled|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|http://www.jsoftware.com/^0|0|1|0|0|0|0|0|0|2|M|R|3|X|1^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|15|8|@]|9|@]|C|$]]|$1|K|3|L|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|M|3|N|5|6|7|17|8|@]|9|@]|C|$]]|$1|O|3|P|5|Q|7|18|8|@$A|19|B|1A|R|S]|$A|1B|B|1C|R|S]|$A|1D|B|1E|R|S]]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]]]

<h1><a href="http://www.jsoftware.com/" rel="nofollow noreferrer">J</a>, 17 bytes</h1>

<pre><code>[-~]^[:&gt;.]^.[:&gt;:[
</code></pre>

<h2>Usage</h2>

<pre><code>   f =: [-~]^[:&gt;.]^.[:&gt;:[
   424 f 3
305
</code></pre>

<h2>Explanation</h2>

<p>Performs <code>pow(b, ceil(log(n+1)))</code> where <code>log</code> has base <code>b</code>. </p>


blocks|key|1113692|text|TXR，51字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1113693|(defun+f(n+b)(-[(ginterate(op+>=+n)(op+*+b)1)-1]n))|code-block|syntax|javascript|1113694|传说：齐墩果，操作.|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|http://www.nongnu.org/txr/txr-manpage.html#N-02F671F4|1|http://www.nongnu.org/txr/txr-manpage.html#N-0068EA9D^0|0|0|3|3|0|7|2|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@$J|X|K|Y|1|Z]|$J|10|K|11|1|12]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]|S|$5|N|O|P|A|$Q|T]]]]

<h2>TXR Lisp, 51 bytes</h2>

<pre><code>(defun f(n b)(-[(ginterate(op &gt;= n)(op * b)1)-1]n))
</code></pre>

<p>Legend: <a href="http://www.nongnu.org/txr/txr-manpage.html#N-02F671F4" rel="nofollow noreferrer">ginterate</a>, <a href="http://www.nongnu.org/txr/txr-manpage.html#N-0068EA9D" rel="nofollow noreferrer">op</a>.</p>


blocks|key|1113925|text|APL，13个字符，26个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1113926|{-⍺-⍵*1%2B⌊⍵⍟⍺}|code-block|syntax|javascript|1113927|测试：|unstyled|1113928|++f←{-⍺-⍵*1%2B⌊⍵⍟⍺}
++212+f+2
44
++563+f+5+
62
++592+f+7
1809|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|O|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|P|8|@]|9|@]|A|$E|F]]]|L|$]]

<h1>APL(NARS), 13 chars, 26 bytes</h1>
<pre><code>{-⍺-⍵*1+⌊⍵⍟⍺}
</code></pre>
<p>test:</p>
<pre><code>  f←{-⍺-⍵*1+⌊⍵⍟⍺}
  212 f 2
44
  563 f 5 
62
  592 f 7
1809
</code></pre>


blocks|key|1113946|text|JavaScript+(ES6)，49字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1113947|f=(n,b)=>b**(m=Math).floor(m.log(n)/m.log(b)%2B1)-n|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>JavaScript (ES6), 49 bytes</h1>

<pre><code>f=(n,b)=&gt;b**(m=Math).floor(m.log(n)/m.log(b)+1)-n
</code></pre>


blocks|key|1114128|text|Python+3，48字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1114129|lambda+n,b:b**int(math.log(n,b)%2B1)-n;import+math|code-block|syntax|javascript|1114130|在网上试试！|unstyled|1114131|我真希望log是内置的|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##VcxNDsIgEIbhvafoEurYhBmKpcabuIGY2iblJw0bT49lYQLLZ77JG79pDZ7y8nzl3Tj7Np0HO9u@33xizqR12MOHnTd@FfzmH5uL4UhdWXI8ytPCUCAg55e/R0UwVpZatEYJVFtpmCqTJLjXPY2NcdJNT@m2R2e/3rEo/wA^0|0|8|0|0|0|0|6|1|0|4|3^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3</a>, 48 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda n,b:b**int(math.log(n,b)+1)-n;import math
</code></pre>
<p><a href="https://tio.run/##VcxNDsIgEIbhvafoEurYhBmKpcabuIGY2iblJw0bT49lYQLLZ77JG79pDZ7y8nzl3Tj7Np0HO9u@33xizqR12MOHnTd@FfzmH5uL4UhdWXI8ytPCUCAg55e/R0UwVpZatEYJVFtpmCqTJLjXPY2NcdJNT@m2R2e/3rEo/wA" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>
<p>I really wish <code>log</code> was builtin</p>


blocks|key|6537503|text|朱莉娅1.0，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6537504|n\b=b%5Efloor(1%2Blog(b,n))-n|code-block|syntax|javascript|6537505|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://julialang.org/|1|https://tio.run/##PY67asQwEEX7@YqbLRaJOMF6rlU4TeIiXYoUKZYFi9UGLUI2sgP5e0d5kKkOwznMXD9SHMXntuWj7/3pkqapMHGbpnfmm8z5Xd4uU0FEzChhPKeYw8I4oU5ufBPQYx7LEu7Zc16bZU5xZZH/CnOJeU2ZsWpy9A@oR/7So8dNj4D9/t/aDW8vw@Pr8IRdg8Ap5PMmhYSE1mSsgoGVpJ2oIJQmLTUUVGtIW4cOWpHSCgfI1nRknKwoutaR7FxNlLJk3U9iSNW2rlpRv5Hf9AU^0|0|6|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://julialang.org/" rel="nofollow noreferrer">Julia 1.0</a>, 25 bytes</h1>

<pre class="lang-julia prettyprint-override"><code>n\b=b^floor(1+log(b,n))-n
</code></pre>
<p><a href="https://tio.run/##PY67asQwEEX7@YqbLRaJOMF6rlU4TeIiXYoUKZYFi9UGLUI2sgP5e0d5kKkOwznMXD9SHMXntuWj7/3pkqapMHGbpnfmm8z5Xd4uU0FEzChhPKeYw8I4oU5ufBPQYx7LEu7Zc16bZU5xZZH/CnOJeU2ZsWpy9A@oR/7So8dNj4D9/t/aDW8vw@Pr8IRdg8Ap5PMmhYSE1mSsgoGVpJ2oIJQmLTUUVGtIW4cOWpHSCgfI1nRknKwoutaR7FxNlLJk3U9iSNW2rlpRv5Hf9AU" rel="nofollow noreferrer" title="Julia 1.0 – Try It Online">Try it online!</a></p>


<p>Let <code>n</code> and <code>b</code> be positive integers larger than <code>1</code>.</p>

<p>Output the distance from <code>n</code> to the next power of <code>b</code>.</p>

<p>For <code>n=5</code> and <code>b=3</code>, the next power of <code>3</code> from <code>5</code> is <code>9</code> (<code>3^2 = 9</code>), so the output is <code>9 - 5 = 4</code>.</p>

<p>For <code>n=8</code> and <code>b=2</code>, the next power of <code>2</code> from <code>8</code> is <code>16</code> (<code>2^4 = 16</code>), so the output is <code>16 - 8 = 8</code>. Note that <code>n</code> is a power of <code>2</code> in this example.</p>

<p>Testcases:</p>

<pre><code>  n b output
212 2 44
563 5 62
491 5 134
424 3 305
469 8 43
343 7 2058
592 7 1809
289 5 336
694 3 35
324 5 301
  2 5 3
</code></pre>

<p>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" rel="tag">code-golf</a>. Shortest answer in bytes wins. <a href="https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default">Standard loopholes</a> apply.</p>


How far away is n to the next power of b?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

设n和b是大于1的正整数。输出从n到b的下一个功率的距离。对于n=5和b=3，来自5的3的下一个功率是9 (3^2 = 9)，因此输出是9 - 5 = 4。对于n=8和b=2，来自8的2的下一个功率是16 (2^4 = 16)，因此输出是16 - 8 = 8。请注意，在本例中，n是2的一个强大功能。测试案例：  n b output212 2 44563 5 62491 5 134424 3 30

问N离b的下一个幂有多远？
EN

回答 23

Code Golf用户

哈斯克尔，20字节

Code Golf用户

R，30字节

Code Golf用户

Mathematica，24字节

I/O

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问N离b的下一个幂有多远？EN

回答 23

Code Golf用户

哈斯克尔，20字节

Code Golf用户

R，30字节

Code Golf用户

Mathematica，24字节

I/O

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问N离b的下一个幂有多远？
EN