blocks|key|1285859|text|维沙尔，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1285860|KḂZµƒε;h×YṄ|code-block|syntax|javascript|1285861|在网上试试！|unstyled|1285862|-2多亏了莱克沙|1285863|K+++++++++++#+Factors
+ḂZ+++++++++#+Zipped+with+reverse
+++µ++;h++++#+Minimum+by
++++ƒε++++++#+Reduced+by+abs.+diff.
++++++++×Y++#+Interleave+with+'*'
++++++++++Ṅ+#+Join+by+spaces|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://vyxal.pythonanywhere.com/#WyIiLCIiLCJL4biCWsK1xpLOtTtow5dZ4bmEIiwiIiwiMTIiXQ==^0|0|3|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|K|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/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a>, 11 bytes</h1>
<pre><code>KḂZµƒε;h×YṄ
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyIiLCIiLCJL4biCWsK1xpLOtTtow5dZ4bmEIiwiIiwiMTIiXQ==" rel="nofollow noreferrer">Try it Online!</a></p>
<p>-2 thanks to lyxal</p>
<pre><code>K           # Factors
 ḂZ         # Zipped with reverse
   µ  ;h    # Minimum by
    ƒε      # Reduced by abs. diff.
        ×Y  # Interleave with '*'
          Ṅ # Join by spaces
</code></pre>


blocks|key|1281924|text|Python+2，74字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1281925|def+f(x):q=[i+for+i+in+range(1,1%2Bx)if+x%25i<1];q=q[len(q)/2];print+q,"*",x/q|code-block|syntax|javascript|1281926|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##BcHBCoMwDADQ@74iCINkK5T2pq5fIh4GNhqQaEoP3dd3792/elwae98yA2OjydIiwFcBAVEoX90zBhfejYShPeUT1tmSLWdWNPJxne8iWsHc8Bpc89YZR3owhkj9Dw^0|0|8|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://docs.python.org/2/" rel="nofollow noreferrer">Python 2</a>, 74 bytes</h1>

<pre class="lang-python prettyprint-override"><code>def f(x):q=[i for i in range(1,1+x)if x%i&lt;1];q=q[len(q)/2];print q,&quot;*&quot;,x/q
</code></pre>
<p><a href="https://tio.run/##BcHBCoMwDADQ@74iCINkK5T2pq5fIh4GNhqQaEoP3dd3792/elwae98yA2OjydIiwFcBAVEoX90zBhfejYShPeUT1tmSLWdWNPJxne8iWsHc8Bpc89YZR3owhkj9Dw" rel="nofollow noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|1285895|text|Python，104个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1285896|lambda+n:'%25d+*+%25d'%25min([(x,n/x)for+x+in[i+for+i+in+range(1,n)if(n/i)%251==0]],key=lambda+x:abs(x[0]-x[1]))|code-block|syntax|javascript|1285897|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.python.org/|1|https://tio.run/##Tc3LDoIwEIXhvU8xm4YZg4FqvJH0SWoXJVCdKANBFuXpERNNuvv@zTnDPD16OSzB3JaX7@rGg1SZamALqslUx4IWYy5FpNCPEIHFMnzJK2H0cm9R50IcUAompY0pncuf7Wx@e7Hy9RujLd0uWu2IlmFkmTDgkWjz9ynxOfEl8TWxLtPQaezXiw8^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="https://www.python.org" rel="nofollow noreferrer">Python</a>, 104 bytes</h1>
<pre><code>lambda n:'%d * %d'%min([(x,n/x)for x in[i for i in range(1,n)if(n/i)%1==0]],key=lambda x:abs(x[0]-x[1]))
</code></pre>
<p><a href="https://tio.run/##Tc3LDoIwEIXhvU8xm4YZg4FqvJH0SWoXJVCdKANBFuXpERNNuvv@zTnDPD16OSzB3JaX7@rGg1SZamALqslUx4IWYy5FpNCPEIHFMnzJK2H0cm9R50IcUAompY0pncuf7Wx@e7Hy9RujLd0uWu2IlmFkmTDgkWjz9ynxOfEl8TWxLtPQaezXiw8" rel="nofollow noreferrer">Try it Online!</a></p>


blocks|key|1285963|text|Python，96字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1285964|f=lambda+x:(lambda+y:str(z:=y[len(y)//2])%2B"+*+"%2Bstr(x//z))([i+for+i+in+range(1,x)+if+x/i==x//i])|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>Python, 96 bytes</h1>
<pre><code>f=lambda x:(lambda y:str(z:=y[len(y)//2])+&quot; * &quot;+str(x//z))([i for i in range(1,x) if x/i==x//i])
</code></pre>


blocks|key|1286221|text|JavaScript+(Node.js)，52字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1286222|f=(n,i=n**.5%7C(-n)**.5)=>n%25i?f(n,i%2B1):i%2B'+*+'%2B(n/i%7C0)|code-block|syntax|javascript|1286223|在网上试试！|unstyled|1286224|JavaScript+(Node.js)，41字节|1286225|f=(n,i=n**.5%7C0)=>n%25i?f(n,i%2B1):i%2B'+*+'%2Bn/i|1286226|1286227|只适用于正数。|entityMap|0|LINK|mutability|MUTABLE|url|https://nodejs.org/|1|https://tio.run/##HYlBCoMwEAC/speSXdOkLVIPtmkf4QuCGtkiG4mhJ/@eamFgBubjv37tEy/ZSBzGEtwOypmdVJW9b2iEjiD3khO/w7H0jVrWCipQGuXC25VKiAmQwYGpmwcwPB38Q2uCPsoa59HOcUK2OXY5sUxIdvFDl33KWBNoUC2oXQGZqPwA|2|3|https://tio.run/##FYhBCsIwEAC/shfJbqPRUvRQjT6iLwhtU1bKbkmDJ/8eIwzMMO/wCfuYeMsn0Wku0VdQjuyladz1eyH/lAO/4v/Zlnq2BhowVs5coiZABg/tHRgeHrpbDWsJRpVd19mtuiC7rENOLAuS28I05JAydgQWTA@mKiITlR8^0|0|K|0|0|0|0|6|1|0|0|K|2|0|0|0|6|3|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|L|3|M|5|6|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|N|3|O|5|F|7|1H|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1I|8|@]|9|@$A|1J|B|1K|1|1L]]|C|$]]|$1|Q|3|R|5|K|7|1M|8|@]|9|@]|C|$]]]|S|$T|$5|U|V|W|C|$X|Y]]|Z|$5|U|V|W|C|$X|10]]|11|$5|U|V|W|C|$X|Y]]|12|$5|U|V|W|C|$X|13]]]]

<h1><a href="https://nodejs.org" rel="nofollow noreferrer">JavaScript (Node.js)</a>, 52 bytes</h1>

<pre class="lang-javascript prettyprint-override"><code>f=(n,i=n**.5|(-n)**.5)=&gt;n%i?f(n,i+1):i+' * '+(n/i|0)
</code></pre>
<p><a href="https://tio.run/##HYlBCoMwEAC/speSXdOkLVIPtmkf4QuCGtkiG4mhJ/@eamFgBubjv37tEy/ZSBzGEtwOypmdVJW9b2iEjiD3khO/w7H0jVrWCipQGuXC25VKiAmQwYGpmwcwPB38Q2uCPsoa59HOcUK2OXY5sUxIdvFDl33KWBNoUC2oXQGZqPwA" rel="nofollow noreferrer" title="JavaScript (Node.js) – Try It Online">Try it online!</a></p>
<hr />
<h1><a href="https://nodejs.org" rel="nofollow noreferrer">JavaScript (Node.js)</a>, 41 bytes</h1>

<pre class="lang-javascript prettyprint-override"><code>f=(n,i=n**.5|0)=&gt;n%i?f(n,i+1):i+' * '+n/i
</code></pre>
<p><a href="https://tio.run/##FYhBCsIwEAC/shfJbqPRUvRQjT6iLwhtU1bKbkmDJ/8eIwzMMO/wCfuYeMsn0Wku0VdQjuyladz1eyH/lAO/4v/Zlnq2BhowVs5coiZABg/tHRgeHrpbDWsJRpVd19mtuiC7rENOLAuS28I05JAydgQWTA@mKiITlR8" rel="nofollow noreferrer" title="JavaScript (Node.js) – Try It Online">Try it online!</a></p>
<p>For positive number only.</p>


blocks|key|1282058|text|因子+%2B+math.primes.factors，73字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1282059|[+divisors+dup+reverse+zip+[+first2+-+abs+]+infimum-by+"%25d+*+%25d"vprintf+]|code-block|syntax|javascript|1282060|在网上试试！|unstyled|1282061|++++++++++++++++++++++++++++!+12
divisors++++++++++++++++++++!+{+1+2+3+4+6+12+}
dup+++++++++++++++++++++++++!+{+1+2+3+4+6+12+}+{+1+2+3+4+6+12+}
reverse+++++++++++++++++++++!+{+1+2+3+4+6+12+}+{+12+6+4+3+2+1+}
zip+++++++++++++++++++++++++!+{+{+1+12+}+{+2+6+}+{+3+4+}+{+4+3+}+{+6+2+}+{+12+1+}+}
[+first2+-+abs+]+infimum-by+!+{+3+4+}
"%25d+*+%25d"vprintf++++++++++++!|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|https://tio.run/##HY2xDoIwFEV3v@KGhMUEEhn1A4yLi3EiDKV91RdpwfcKif58RaY7nHNyvbFplHy/Xa7nI4JJz3oSDqS134jiRRJpgNJ7pmhJYVRHq5sLP8q6ieMDp92hyS0cL6z/zs0ThBYSJXx5QgvPoqlBBdMrOnD0HOZQ9R8UpcMepSuW9Twmjy5bMwz5Bw^0|5|J|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@$9|11|A|12|1|13]]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|N|3|O|5|H|7|19|8|@]|D|@]|E|$I|J]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a> + <code>math.primes.factors</code>, 73 bytes</h1>
<pre><code>[ divisors dup reverse zip [ first2 - abs ] infimum-by &quot;%d * %d&quot;vprintf ]
</code></pre>
<p><a href="https://tio.run/##HY2xDoIwFEV3v@KGhMUEEhn1A4yLi3EiDKV91RdpwfcKif58RaY7nHNyvbFplHy/Xa7nI4JJz3oSDqS134jiRRJpgNJ7pmhJYVRHq5sLP8q6ieMDp92hyS0cL6z/zs0ThBYSJXx5QgvPoqlBBdMrOnD0HOZQ9R8UpcMepSuW9Twmjy5bMwz5Bw" rel="nofollow noreferrer" title="Factor – Try It Online">Try it online!</a></p>
<pre><code>                            ! 12
divisors                    ! { 1 2 3 4 6 12 }
dup                         ! { 1 2 3 4 6 12 } { 1 2 3 4 6 12 }
reverse                     ! { 1 2 3 4 6 12 } { 12 6 4 3 2 1 }
zip                         ! { { 1 12 } { 2 6 } { 3 4 } { 4 3 } { 6 2 } { 12 1 } }
[ first2 - abs ] infimum-by ! { 3 4 }
&quot;%d * %d&quot;vprintf            !
</code></pre>


blocks|key|1282180|text|帕里/GP，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1282181|n->vecmin([abs(d-n/d)%7Cd<-divisors(n)])|code-block|syntax|javascript|1282182|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/|1|https://tio.run/##K0gsytRNL/ifpmD7P0/Xriw1OTczTyM6MalYI0U3Tz9FsybFRjclsyyzOL@oWCNPM1bzf0FRZl6JRpqGoZGm5n8A^0|0|5|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://pari.math.u-bordeaux.fr/" rel="nofollow noreferrer">Pari/GP</a>, 38 bytes</h1>
<pre><code>n-&gt;vecmin([abs(d-n/d)|d&lt;-divisors(n)])
</code></pre>
<p><a href="https://tio.run/##K0gsytRNL/ifpmD7P0/Xriw1OTczTyM6MalYI0U3Tz9FsybFRjclsyyzOL@oWCNPM1bzf0FRZl6JRpqGoZGm5n8A" rel="nofollow noreferrer" title="Pari/GP – Try It Online">Try it online!</a></p>


<h2>Input:</h2>
<p>An integer <code>n</code></p>
<h2>Output:</h2>
<p>A string <code>A * B</code></p>
<h2>Example</h2>
<p><code>12</code></p>
<p>Possible 2 divisible numbers: <code>12 * 1</code>, <code>6 * 2</code>, <code>4 * 3</code></p>
<pre><code>12-1 = 11

6-2 = 4

4-3 = 1
</code></pre>
<p>4 and 3 has the minimal absolute difference of 1</p>
<p>Therefore, Output:</p>
<p><code>4 * 3</code></p>
<p><em>Order of the numbers does <strong>not</strong> matter</em></p>
<p><em>This challenge idea was taken from a puzzle in Clash of Code in <a href="https://www.codingame.com" rel="nofollow noreferrer">https://www.codingame.com</a></em></p>
<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>, so shortest answer in bytes wins!</p>


Find the absolute minimum difference between 2 divided numbers from n

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

输入：整数n输出：字符串A * B示例12可能有2个可除数：12 * 1，6 * 2，4 * 312-1 = 116-2 = 44-3 = 14和3的绝对值最小差为1。因此，产出：4 * 3数字的顺序不重要这个挑战的想法来自于https://www.codingame.com中代码冲突中的一个难题。这是密码-高尔夫，所以最短的答案以字节为单位获胜！

问从n中求出两个除数之间的绝对最小差
EN

输入：

输出：

示例

回答 7

Code Golf用户

维沙尔，11字节

Code Golf用户

Python 2，74字节

Code Golf用户

Python，104个字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问从n中求出两个除数之间的绝对最小差EN

输入：

输出：

示例

回答 7

Code Golf用户

维沙尔，11字节

Code Golf用户

Python 2，74字节

Code Golf用户

Python，104个字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问从n中求出两个除数之间的绝对最小差
EN