blocks|key|1299890|text|Python+2，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1299891|lambda+t:t-t/100*40|code-block|syntax|javascript|1299892|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##K6gsycjPM/qfZhvzPycxNyklUaHEqkS3RN/QwEDLxOB/Wn6RQolCZp6CoY6CIRhDCCBpCURgDCEsrbgUFAqKMvNKFNI0SjT/AwA^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="noreferrer">Python 2</a>, 19 bytes</h1>



<pre class="lang-python prettyprint-override"><code>lambda t:t-t/100*40
</code></pre>

<p><a href="https://tio.run/##K6gsycjPM/qfZhvzPycxNyklUaHEqkS3RN/QwEDLxOB/Wn6RQolCZp6CoY6CIRhDCCBpCURgDCEsrbgUFAqKMvNKFNI0SjT/AwA" rel="noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|1299705|text|杰夫特，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1299706|ìL+ì60|code-block|syntax|javascript|1299707|在线测试！+ìL转换为基-100，ì60转换回基60，从而生成floor(n/100)*60+%2B+n%25100。也适用于小时(10000+->+3600，一小时内的秒数)。|unstyled|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://ethproductions.github.io/japt/?v=1.4.5&code=7Ewg7DYw&input=OTk5OQ==^0|0|3|0|0|0|6|2|H|3|V|N|1Q|D|0|5|1^^$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|@$A|12|B|13|L|M]|$A|14|B|15|L|M]|$A|16|B|17|L|M]|$A|18|B|19|L|M]]|9|@$A|1A|B|1B|1|1C]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

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

<pre><code>ìL ì60
</code></pre>

<p><a href="https://ethproductions.github.io/japt/?v=1.4.5&amp;code=7Ewg7DYw&amp;input=OTk5OQ==" rel="noreferrer">Test it online!</a> <code>ìL</code> converts to base-100, and <code>ì60</code> converts back to base 60, resulting in <code>floor(n/100)*60 + n%100</code>. Also works with hours (<code>10000 -&gt; 3600</code>, the number of seconds in an hour).</p>


blocks|key|1299573|text|TI-Basic+(83系列)，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1299574|Ans-40int(sub(Ans|code-block|syntax|javascript|1299575|需要操作系统版本1.15或更高版本。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>TI-Basic (83 series), 8 bytes</h1>

<pre><code>Ans-40int(sub(Ans
</code></pre>

<p>Requires OS version 1.15 or higher.</p>


blocks|key|1300356|text|C，C%2B%2B，Java，C#，D:+36字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1300357|D+:+35字节|1300358|C+:+28字节|1300359|我第一次有这么短的答案！|unstyled|1300360|int+r(int+i){return+i/100*60%2Bi%25100;}|code-block|syntax|javascript|1300361|D可以有一个特殊的优化，因为黄金模板系统：|1300362|T+r(T)(T+i){return+i/100*60%2Bi%25100;}|1300363|C对隐式int有一个特殊的优化：|1300364|r(i){return+i/100*60%2Bi%25100;}|1300365|测试代码|1300366|1300367|在C中(必须包括stdio.h+)：|offset|length|style|CODE|1300368|int+main()+{
++++int+testArr[]+=+{1,11,111,1111,9,99,999,9999};
++++for(int+i=0;i<8;+%2B%2Bi)+{
++++++++printf("%25d+=+%25d\n",testArr[i],r(testArr[i]));
++++}
++++return+0;
}|1300369|TIO链|1300370|在C%2B%2B中(必须包括iostream+)：|1300371|int+main()+{
++++std::initializer_list<int>+testList{
++++++++1,11,111,1111,9,99,999,9999
++++};

++++for+(auto+x+:+testList)+{
++++++++std::cout+<<+r(x)+<<+'\n';
++++}
}|1300372|在网上试试！|1300373|在Java中：|1300374|public+class+MainApp+{

++++int+r(int+i){return+i/100*60%2Bi%25100;}

++++public+static+void+main(String[]a)+{
++++++++MainApp+m+=+new+MainApp();
++++++++int+testArr[]+=+new+int[]{
++++++++++++++++1,11,111,1111,9,99,999,9999
++++++++};

++++++++for+(int+v+:+testArr)+{
++++++++++++System.out.println(v+%2B+"+=+"+%2B+m.r(v));
++++++++}
++++}
}|1300375|1300376|在C#中|1300377|class+Program+{
++++int+r(int+i){return+i/100*60%2Bi%25100;}
++++static+void+Main(string[]+args)+{
++++++++var+p+=+new+Program();
++++++++int[]+testArr+=+new+int[8]
++++++++{
++++++++++++1,11,111,1111,9,99,999,9999
++++++++};
++++++++foreach(int+a+in+testArr)+{
++++++++++++Console.WriteLine(a+%2B+"+=+"+%2B+p.r(a));
++++++++}
++++}
}|1300378|在D中(必须导入std.stdio+)(确切地说，我不知道如何在D中使用数组)：|1300379|void+main()+{
++++int[]+arr+=+[1,11,111,1111,9,9,999,9999];
++++for(int+i+=+0;+i+<+arr.length;+i%2B%2B)
++++++++writeln(arr[i],"+=+",r(arr[i]));
}+|1300380|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##RU7LDsIgELz3K0hNE7CocDE2tCZ@h/ZgoK2bKDWUnhq@HQFtnOxs9pGdWbkbpPQb0PI5q66erIJx/zh7g4EsprOz0QgOnLHtkZVQhEI4D9qi1x00JmjJUEAc2G6yF2OuLWrQwimPkchpRasYiZUT6aQfg0U4g4YJqE8ClSWschFvE7Y9zgsV9Ap10zldHaClBv8bQr6KLuXfz0xkzn8A|1|https://tio.run/##PU3RCoMwDHz3K8LGsG6O2ZeBtfgF@4TBkNqNgLZSI8jEb3etMsMll8DlTnXd9aPUsqAhcCxMTCanaXAG8Maz7HzPLnjySzEvRzSqGWoNEm1PTldtGYWXtkLDEpgi8NVTLQQaJKwa/Gr3arAn6WUlkO7p4a9NGIqnPGBtnuZpHrB2vmrmIlr5bR2waiALI4jd5x@5xyo7EEjpRX4cBBwCOzYmgeOniYvNNZqXHw|2|https://tio.run/##TU9LDoIwEN1ziomJSVFE2JggceEBXLkkLCpWU4RC2qHGEM6ObUX0ZX5t38y8llTTTdMyUV4fY9tdKl5AUVGl4ES5gH7kAkESG7nfS4adFMC3cRStdtGaL02RDqMHBlO3Qoom6YZfoTYzyBklF/cspz70jmjhptdwAMGe7kD8dH6025ApPEqZ5RPH3GX5r/@LOIitOY@DJEisOU9m7pB6c31rJLjfaNh/d/zrsji/FLI6bDoMWyMdK0E0rGFhlCxMrkNJtP8nd/A@cRjf|3|https://tio.run/##LYvBCoMwDIbP7VMEYdDO4trLQLq9hTfxIOi2gLYj67aD@OxdlJF8JD/5MmScn5ESvNJQMRh9boBUo1UDqBca05sC4MlZezzbEg@8@DV/Ig4w9xiUhkUKDKntoCeCK7TOuK13nKm3qnfqzktxi6RYB2TVeh6X7a@axnBPD85lqaUQX8I0TkHxqcXOFCwXhv5Ray9XyD8^0|0|0|0|0|0|0|0|0|0|0|0|8|7|0|0|0|4|0|0|A|8|0|0|0|6|1|0|0|0|0|6|2|0|0|0|8|9|0|0|0|4|3^^$0|@$1|2|3|4|5|6|7|25|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|26|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|27|8|@]|9|@]|A|$]]|$1|F|3|G|5|H|7|28|8|@]|9|@]|A|$]]|$1|I|3|J|5|K|7|29|8|@]|9|@]|A|$L|M]]|$1|N|3|O|5|H|7|2A|8|@]|9|@]|A|$]]|$1|P|3|Q|5|K|7|2B|8|@]|9|@]|A|$L|M]]|$1|R|3|S|5|H|7|2C|8|@]|9|@]|A|$]]|$1|T|3|U|5|K|7|2D|8|@]|9|@]|A|$L|M]]|$1|V|3|W|5|H|7|2E|8|@]|9|@]|A|$]]|$1|X|3|-4|5|H|7|2F|8|@]|9|@]|A|$]]|$1|Y|3|Z|5|H|7|2G|8|@$10|2H|11|2I|12|13]]|9|@]|A|$]]|$1|14|3|15|5|K|7|2J|8|@]|9|@]|A|$L|M]]|$1|16|3|17|5|H|7|2K|8|@]|9|@$10|2L|11|2M|1|2N]]|A|$]]|$1|18|3|19|5|H|7|2O|8|@$10|2P|11|2Q|12|13]]|9|@]|A|$]]|$1|1A|3|1B|5|K|7|2R|8|@]|9|@]|A|$L|M]]|$1|1C|3|1D|5|H|7|2S|8|@]|9|@$10|2T|11|2U|1|2V]]|A|$]]|$1|1E|3|1F|5|H|7|2W|8|@]|9|@]|A|$]]|$1|1G|3|1H|5|K|7|2X|8|@]|9|@]|A|$L|M]]|$1|1I|3|1D|5|H|7|2Y|8|@]|9|@$10|2Z|11|30|1|31]]|A|$]]|$1|1J|3|1K|5|H|7|32|8|@]|9|@]|A|$]]|$1|1L|3|1M|5|K|7|33|8|@]|9|@]|A|$L|M]]|$1|1N|3|1O|5|H|7|34|8|@$10|35|11|36|12|13]]|9|@]|A|$]]|$1|1P|3|1Q|5|K|7|37|8|@]|9|@]|A|$L|M]]|$1|1R|3|17|5|H|7|38|8|@]|9|@$10|39|11|3A|1|3B]]|A|$]]]|1S|$1T|$5|1U|1V|1W|A|$1X|1Y]]|1Z|$5|1U|1V|1W|A|$1X|20]]|21|$5|1U|1V|1W|A|$1X|22]]|23|$5|1U|1V|1W|A|$1X|24]]]]

<h2>C, C++, Java, C#, D : 36 bytes</h2>

<h3>D : 35 bytes</h3>

<h3>C : 28 bytes</h3>

<p>First time i have an answer that short !</p>

<pre class="lang-cpp prettyprint-override"><code>int r(int i){return i/100*60+i%100;}
</code></pre>

<p>D can have a special optimization because of the golfy template system :</p>

<pre class="lang-d prettyprint-override"><code>T r(T)(T i){return i/100*60+i%100;}
</code></pre>

<p>C has a special optimization with the implicit int :</p>

<pre class="lang-c prettyprint-override"><code>r(i){return i/100*60+i%100;}
</code></pre>

<p>Code to test <br></p>

<p>In <strong>C</strong> ( have to include <code>stdio.h</code> ) :</p>

<pre class="lang-c prettyprint-override"><code>int main() {
    int testArr[] = {1,11,111,1111,9,99,999,9999};
    for(int i=0;i&lt;8; ++i) {
        printf("%d = %d\n",testArr[i],r(testArr[i]));
    }
    return 0;
}
</code></pre>

<p><a href="https://tio.run/##RU7LDsIgELz3K0hNE7CocDE2tCZ@h/ZgoK2bKDWUnhq@HQFtnOxs9pGdWbkbpPQb0PI5q66erIJx/zh7g4EsprOz0QgOnLHtkZVQhEI4D9qi1x00JmjJUEAc2G6yF2OuLWrQwimPkchpRasYiZUT6aQfg0U4g4YJqE8ClSWschFvE7Y9zgsV9Ap10zldHaClBv8bQr6KLuXfz0xkzn8A" rel="nofollow noreferrer">TIO Link</a></p>

<p>In <strong>C++</strong> ( have to include <code>iostream</code> ) :</p>

<pre class="lang-cpp prettyprint-override"><code>int main() {
    std::initializer_list&lt;int&gt; testList{
        1,11,111,1111,9,99,999,9999
    };

    for (auto x : testList) {
        std::cout &lt;&lt; r(x) &lt;&lt; '\n';
    }
}
</code></pre>

<p><a href="https://tio.run/##PU3RCoMwDHz3K8LGsG6O2ZeBtfgF@4TBkNqNgLZSI8jEb3etMsMll8DlTnXd9aPUsqAhcCxMTCanaXAG8Maz7HzPLnjySzEvRzSqGWoNEm1PTldtGYWXtkLDEpgi8NVTLQQaJKwa/Gr3arAn6WUlkO7p4a9NGIqnPGBtnuZpHrB2vmrmIlr5bR2waiALI4jd5x@5xyo7EEjpRX4cBBwCOzYmgeOniYvNNZqXHw" rel="nofollow noreferrer" title="C++ (gcc) – Try It Online">Try it online!</a></p>

<p>In <strong>Java</strong> :</p>

<pre class="lang-java prettyprint-override"><code>public class MainApp {

    int r(int i){return i/100*60+i%100;}

    public static void main(String[]a) {
        MainApp m = new MainApp();
        int testArr[] = new int[]{
                1,11,111,1111,9,99,999,9999
        };

        for (int v : testArr) {
            System.out.println(v + " = " + m.r(v));
        }
    }
}
</code></pre>

<p><a href="https://tio.run/##TU9LDoIwEN1ziomJSVFE2JggceEBXLkkLCpWU4RC2qHGEM6ObUX0ZX5t38y8llTTTdMyUV4fY9tdKl5AUVGl4ES5gH7kAkESG7nfS4adFMC3cRStdtGaL02RDqMHBlO3Qoom6YZfoTYzyBklF/cspz70jmjhptdwAMGe7kD8dH6025ApPEqZ5RPH3GX5r/@LOIitOY@DJEisOU9m7pB6c31rJLjfaNh/d/zrsji/FLI6bDoMWyMdK0E0rGFhlCxMrkNJtP8nd/A@cRjf" rel="nofollow noreferrer" title="Java (OpenJDK 8) – Try It Online">Try it online!</a></p>

<p>In <strong>C#</strong></p>

<pre class="lang-cs prettyprint-override"><code>class Program {
    int r(int i){return i/100*60+i%100;}
    static void Main(string[] args) {
        var p = new Program();
        int[] testArr = new int[8]
        {
            1,11,111,1111,9,99,999,9999
        };
        foreach(int a in testArr) {
            Console.WriteLine(a + " = " + p.r(a));
        }
    }
}
</code></pre>

<p>In <strong>D</strong> ( have to import <code>std.stdio</code> ) ( exactly, i have no idea how to use arrays in D ) :</p>

<pre class="lang-d prettyprint-override"><code>void main() {
    int[] arr = [1,11,111,1111,9,9,999,9999];
    for(int i = 0; i &lt; arr.length; i++)
        writeln(arr[i]," = ",r(arr[i]));
} 
</code></pre>

<p><a href="https://tio.run/##LYvBCoMwDIbP7VMEYdDO4trLQLq9hTfxIOi2gLYj67aD@OxdlJF8JD/5MmScn5ESvNJQMRh9boBUo1UDqBca05sC4MlZezzbEg@8@DV/Ig4w9xiUhkUKDKntoCeCK7TOuK13nKm3qnfqzktxi6RYB2TVeh6X7a@axnBPD85lqaUQX8I0TkHxqcXOFCwXhv5Ray9XyD8" rel="nofollow noreferrer">TIO Link</a></p>


blocks|key|162050|text|数据中心，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162051|?9A~r60*%2Bp|code-block|syntax|javascript|162052|在网上试试！|unstyled|162053|说明:在华盛顿，当你推动某事物时。在堆栈上，它在顶部|162054|?+++++++++#+read+and+push+the+input+number+on+the+stack
9A++++++++#+push+100:+9+*+10%5E1+%2B+A[10]+*+10%5E0+:D
~+++++++++#+divide+2nd+nr.+by+the+top+nr.,+push+quotient,+then+remainder
r60*++++++#+swap+top+2+nr.,+then+multiply+the+top+by+60
%2Bp++++++++#+add+top+2+nr.,+then+print+result|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html|1|https://tio.run/##S0n@/9/e0rGuyMxAS7vg/39DQ0MA^0|0|4|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]]]]

<h2><a href="https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html" rel="noreferrer">dc</a>, 10 bytes</h2>

<pre class="lang-dc prettyprint-override"><code>?9A~r60*+p
</code></pre>

<p><a href="https://tio.run/##S0n@/9/e0rGuyMxAS7vg/39DQ0MA" rel="noreferrer">Try it online!</a></p>

<p><strong>Explanation:</strong> in dc when you push sth. on the stack it goes on top</p>

<pre class="lang-dc prettyprint-override"><code>?         # read and push the input number on the stack
9A        # push 100: 9 * 10^1 + A[10] * 10^0 :D
~         # divide 2nd nr. by the top nr., push quotient, then remainder
r60*      # swap top 2 nr., then multiply the top by 60
+p        # add top 2 nr., then print result
</code></pre>


blocks|key|1299804|text|果冻，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1299805|作为一元链接(谢谢你的提醒，凯恩！)：|unstyled|1299806|b³ḅ60|code-block|syntax|javascript|1299807|在网上试试！|1299808|..。或者作为一个完整的程序：|1299809|bȷ2ḅ60|1299810|这可以很容易地移植到05AB1E，因此：|1299811|05AB1E，5字节|1299812|тв60β|1299813|1299814|只需将输入整数转换为基数100，然后将结果从基数60转换为整数。因此，它相当于输入%25+100+%2B+60+*⌊输入/+100⌋|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8/z/p0OaHO1rNDP5bAsHh9v8A|2|https://github.com/Adriandmen/05AB1E|3|https://tio.run/##MzBNTDJM/f//YtOFTWYG5zb9/28JBAA^0|0|2|0|0|0|0|0|6|1|0|0|0|0|0|6|2|0|0|0|6|3|0^^$0|@$1|2|3|4|5|6|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|D|3|E|5|F|7|1H|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|1I|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|N|3|O|5|F|7|1N|8|@]|9|@]|C|$]]|$1|P|3|Q|5|I|7|1O|8|@]|9|@]|C|$J|K]]|$1|R|3|S|5|F|7|1P|8|@]|9|@]|C|$]]|$1|T|3|U|5|6|7|1Q|8|@]|9|@$A|1R|B|1S|1|1T]]|C|$]]|$1|V|3|W|5|I|7|1U|8|@]|9|@]|C|$J|K]]|$1|X|3|M|5|F|7|1V|8|@]|9|@$A|1W|B|1X|1|1Y]]|C|$]]|$1|Y|3|Z|5|F|7|1Z|8|@]|9|@]|C|$]]]|10|$11|$5|12|13|14|C|$15|16]]|17|$5|12|13|14|C|$15|18]]|19|$5|12|13|14|C|$15|1A]]|1B|$5|12|13|14|C|$15|1C]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 5 bytes</h1>

<p>As a monadic link (thanks for the heads-up, caird!):</p>

<pre><code>b³ḅ60
</code></pre>

<p><a href="https://tio.run/##y0rNyan8/z/p0OaHO1rNDP5bAsHh9v8A" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>

<p>... Or as a full program:</p>

<pre><code>bȷ2ḅ60
</code></pre>

<p>This can be ported easily to 05AB1E, so:</p>

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 5 bytes</h1>

<pre><code>тв60β
</code></pre>

<p><a href="https://tio.run/##MzBNTDJM/f//YtOFTWYG5zb9/28JBAA" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>

<p>Simply converts the input integer to base <strong>100</strong> and then converts the result from base <strong>60</strong> to integer. Hence, it is equivalent to <strong>Input % 100 + 60 * ⌊Input / 100⌋</strong></p>


blocks|key|1300062|text|C+(gcc)，50字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300063|t;f(){scanf("%25d",&t);printf("%25d",t%25100%2Bt/100*60);}|code-block|syntax|javascript|1300064|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://gcc.gnu.org/|1|https://tio.run/##S9ZNT07@/7/EOk1Ds7o4OTEvTUNJNUVJR61E07qgKDOvBMovUTU0MNAu0QeSWmYGmta1/4FyCrmJmXlAfUC9QAEA^0|0|7|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://gcc.gnu.org/" rel="nofollow noreferrer">C (gcc)</a>, 50 bytes</h1>



<pre class="lang-c prettyprint-override"><code>t;f(){scanf("%d",&amp;t);printf("%d",t%100+t/100*60);}
</code></pre>

<p><a href="https://tio.run/##S9ZNT07@/7/EOk1Ds7o4OTEvTUNJNUVJR61E07qgKDOvBMovUTU0MNAu0QeSWmYGmta1/4FyCrmJmXlAfUC9QAEA" rel="nofollow noreferrer" title="C (gcc) – Try It Online">Try it online!</a></p>


blocks|key|162594|text|Java+8，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|162595|n->n-n/100*40|code-block|syntax|javascript|162596|@ovs“惊人的Python+2公式”港。|unstyled|offset|length|162597|在这里试试。|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/147787/52210|1|https://tio.run/##jc9NCoMwEAXgvaeYZSxoI@2mSHuDunFZukhjWmJ1FDMKpXj2NP5sS4QkMPM@eKQUg4iaVmFZvK2shDFwFRq/AYBGUt1TSAXZNM4LkGx6MUzdZnTXHUOCtIQMEM5gMbpghPuE892R23Qhbf@oHFnl0OgCatfCcuo0vm53EOFSkX8MqTpueopbF1GFDGPJknAu/J/7wQbhIydf7gcbhJdw308OqxiD0f4A^0|0|0|0|J|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@]|9|@$J|13|K|14|1|15]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]|U|$5|P|Q|R|A|$S|V]]]]

<h1>Java 8, 13 bytes</h1>

<pre class="lang-java prettyprint-override"><code>n-&gt;n-n/100*40
</code></pre>
<p>Port of <a href="https://codegolf.stackexchange.com/a/147787/52210"><em>@ovs</em>' amazing Python 2 formula</a>.</p>
<p><a href="https://tio.run/##jc9NCoMwEAXgvaeYZSxoI@2mSHuDunFZukhjWmJ1FDMKpXj2NP5sS4QkMPM@eKQUg4iaVmFZvK2shDFwFRq/AYBGUt1TSAXZNM4LkGx6MUzdZnTXHUOCtIQMEM5gMbpghPuE892R23Qhbf@oHFnl0OgCatfCcuo0vm53EOFSkX8MqTpueopbF1GFDGPJknAu/J/7wQbhIydf7gcbhJdw308OqxiD0f4A" rel="nofollow noreferrer">Try it here.</a></p>


blocks|key|1299549|text|JavaScript，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1299550|a=>(a/100%5E0)*60%2Ba%25100|code-block|syntax|javascript|1299551|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##HYxBCoMwEAC/0ksxqWuabUXNwX6kKC4aIYImJGn7/FSFGZjTLPSlMHrjYrHZSae5TdS@GN1Ryl7yWyVzuu6dnLejDkGEONlPFD9vomZvBDw4RVCgDk4V4ONZgmrqqhMrObZvZ0Z5lnEuFmu24TLw9Ac^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>JavaScript, 21 bytes</h1>

<pre><code>a=&gt;(a/100^0)*60+a%100
</code></pre>

<p><a href="https://tio.run/##HYxBCoMwEAC/0ksxqWuabUXNwX6kKC4aIYImJGn7/FSFGZjTLPSlMHrjYrHZSae5TdS@GN1Ryl7yWyVzuu6dnLejDkGEONlPFD9vomZvBDw4RVCgDk4V4ONZgmrqqhMrObZvZ0Z5lnEuFmu24TLw9Ac" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|162124|text|J，12字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162125|-40*&<.%25&100|code-block|syntax|javascript|162126|它是用J表示的ovs的Python+2解决方案，它由一个钩子和一个叉子组成：|unstyled|162127|┌─┬───────────────────────┐
│-│┌──┬────────┬─────────┐│
│+││40│┌─┬─┬──┐│┌─┬─┬───┐││
│+││++││*│&│<.│││%25│&│100│││
│+││++│└─┴─┴──┘│└─┴─┴───┘││
│+│└──┴────────┴─────────┘│
└─┴───────────────────────┘

+++++++%25&100++-+divides+the+number+by+100
+++*&<.+++++++-+finds+the+floor+of+the+left+argument+and+multiplies+it+to+the+left+arg.
+40+++++++++++-+
-+++++++++++++-+subtracts+the+result+of+the+above+fork+from+the+input+|162128|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://jsoftware.com/|1|https://tio.run/##y/qfVqxgq6dgoGClYPBf18RAS81GT1XN0MDgvyaXkp6CepqtlbqCjkKtlUJaMRdXanJGvkKagiGcYaiAYCKJItiWcAYSC5lp@f8/AA^0|0|1|0|0|0|0|0|0|6|1^^$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|@]|C|$]]|$1|L|3|M|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

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

<pre><code>-40*&amp;&lt;.%&amp;100
</code></pre>

<p>It's ovs' Python 2 solution expressed in J. It consist of a hook and a fork:</p>

<pre><code>┌─┬───────────────────────┐
│-│┌──┬────────┬─────────┐│
│ ││40│┌─┬─┬──┐│┌─┬─┬───┐││
│ ││  ││*│&amp;│&lt;.│││%│&amp;│100│││
│ ││  │└─┴─┴──┘│└─┴─┴───┘││
│ │└──┴────────┴─────────┘│
└─┴───────────────────────┘

       %&amp;100  - divides the number by 100
   *&amp;&lt;.       - finds the floor of the left argument and multiplies it to the left arg.
 40           - 
-             - subtracts the result of the above fork from the input 
</code></pre>

<p><a href="https://tio.run/##y/qfVqxgq6dgoGClYPBf18RAS81GT1XN0MDgvyaXkp6CepqtlbqCjkKtlUJaMRdXanJGvkKagiGcYaiAYCKJItiWcAYSC5lp@f8/AA" rel="nofollow noreferrer" title="J – Try It Online">Try it online!</a></p>


blocks|key|1300126|text|批处理，23字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1300127|@cmd/cset/a%251-%251/100*40|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|$]]

<h2>Batch, 23 bytes</h2>

<pre><code>@cmd/cset/a%1-%1/100*40
</code></pre>


blocks|key|162312|text|哈斯克尔，18字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162313|f+t=t-t`div`100*40|code-block|syntax|javascript|162314|在网上试试！|unstyled|162315|阿诺萨港。|162316|无点解决方案，21字节|162317|(-)<*>(*40).(`div`40)|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##y0gszk7Nyfn/P02hxLZEtyQhJbMswdDAQMvE4H9uYmaegq1CbmKBr4JGQVFmXomCnkK6pkK0oY6CIRhDCCBpCURgDCEsY/8DAA^0|0|4|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://www.haskell.org/" rel="nofollow noreferrer">Haskell</a>, 18 bytes</h1>



<pre class="lang-hs prettyprint-override"><code>f t=t-t`div`100*40
</code></pre>

<p><a href="https://tio.run/##y0gszk7Nyfn/P02hxLZEtyQhJbMswdDAQMvE4H9uYmaegq1CbmKBr4JGQVFmXomCnkK6pkK0oY6CIRhDCCBpCURgDCEsY/8DAA" rel="nofollow noreferrer" title="Haskell – Try It Online">Try it online!</a></p>

<p>Anotha port.</p>

<h2>Pointfree solution, 21 bytes</h2>

<pre class="lang-hs prettyprint-override"><code>(-)&lt;*&gt;(*40).(`div`40)
</code></pre>


blocks|key|1300410|text|视网膜，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300411|.{100}
60$*|code-block|syntax|javascript|1300412|在网上试试！|unstyled|1300413|输入输出一元。为了方便起见，测试套件从十进制转换为十进制。|1300414|只进行两位数的这种基值转换是非常简单的。我们只需匹配100+1s的运行，用60+1s替换它们。剩下的任何东西都将与十进制表示中的最后两位数相对应，并且保持不变。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/m-ender/retina|1|https://tio.run/##K0otycxL/K@qkaCnzaWi9V@v2tDAoJbLzADE/m/IZQhCYGzIZcllCUJgbAkA|2|http://meta.codegolf.stackexchange.com/questions/5343/can-numeric-input-output-be-in-unary^0|0|3|0|0|0|0|6|1|0|4|2|2|0|U|1|14|1^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|K|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|N|3|O|5|K|7|1F|8|@$A|1G|B|1H|P|Q]|$A|1I|B|1J|P|Q]]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]]]

<h2><a href="https://github.com/m-ender/retina" rel="nofollow noreferrer">Retina</a>, 11 bytes</h2>

<pre><code>.{100}
60$*
</code></pre>

<p><a href="https://tio.run/##K0otycxL/K@qkaCnzaWi9V@v2tDAoJbLzADE/m/IZQhCYGzIZcllCUJgbAkA" rel="nofollow noreferrer" title="Retina – Try It Online">Try it online!</a></p>

<p>Input and output <a href="http://meta.codegolf.stackexchange.com/questions/5343/can-numeric-input-output-be-in-unary">in unary</a>. The test suite converts from and to decimal for convenience.</p>

<p>Doing this kind of base conversion for only up to two digits is surprisingly simple to do in unary. We just match runs of 100 <code>1</code>s and replace them with 60 <code>1</code>s. Anything that's left over would correspond to the last two digits in the decimal representation and remains unchanged.</p>


blocks|key|1300517|text|爱丽丝，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300518|/o
\i@/.'d%25~'d:'<*%2B|code-block|syntax|javascript|1300519|在网上试试！|unstyled|1300520|解释|1300521|可惜我把divmod从语言里删除了，我想.|1300522|/o
\i@/...|1300523|这只是线性程序的通常框架，十进制I/O纯粹在基数(算术)模式下工作。|1300524|.+++++Duplicate+input.
'd%25+++Mod+100.
~+++++Swap+with+other+copy.
'd:+++Divide+by+100.
'<*+++Multiply+by+60.
%2B+++++Add.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/m-ender/alice|1|https://tio.run/##S8zJTE79/18/nysm00FfTz1FtU49xUrdRkv7/39DIAAA^0|0|3|0|0|0|0|6|1|0|0|0|0|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|@]|C|$]]|$1|N|3|O|5|K|7|1E|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1F|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|K|7|1G|8|@]|9|@]|C|$]]|$1|T|3|U|5|F|7|1H|8|@]|9|@]|C|$G|H]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]]]

<h2><a href="https://github.com/m-ender/alice" rel="nofollow noreferrer">Alice</a>, 19 bytes</h2>

<pre><code>/o
\i@/.'d%~'d:'&lt;*+
</code></pre>

<p><a href="https://tio.run/##S8zJTE79/18/nysm00FfTz1FtU49xUrdRkv7/39DIAAA" rel="nofollow noreferrer" title="Alice – Try It Online">Try it online!</a></p>

<h3>Explanation</h3>

<p>Too bad I removed <em>divmod</em> from the language, I guess...</p>

<pre><code>/o
\i@/...
</code></pre>

<p>This is just the usual framework for linear programs with decimal I/O operating purely in Cardinal (arithmetic) mode.</p>

<pre><code>.     Duplicate input.
'd%   Mod 100.
~     Swap with other copy.
'd:   Divide by 100.
'&lt;*   Multiply by 60.
+     Add.
</code></pre>


blocks|key|1300587|text|迷宫，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300588|?:_100%25}#00/_60*{%2B!|code-block|syntax|javascript|1300589|在网上试试！|unstyled|1300590|解释|1300591|?++++++Read+input.
:++++++Duplicate.
_100%25++Mod+100.
}++++++Move+off+to+auxiliary+stack.
#00/+++Divide+by+100,+using+the+stack+depth+to+get+a+1,+instead+of+_1.
_60*+++Multiply+by+60.
{%2B+++++Retrieve+the+earlier+result+and+add+it.
!++++++Print.|1300592|然后IP到达一个死胡同，并开始向后移动。当它到达/时，它会尝试将程序除以零，从而终止程序。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/m-ender/labyrinth|1|https://tio.run/##y0lMqizKzCvJ@P/f3ire0MBAtVbZwEA/3sxAq1pb8f9/Q0NDAA^0|0|2|0|0|0|0|6|1|0|0|0|O|1^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|6|7|1B|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1C|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1D|8|@$A|1E|B|1F|R|S]]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h2><a href="https://github.com/m-ender/labyrinth" rel="nofollow noreferrer">Labyrinth</a>, 19 bytes</h2>

<pre><code>?:_100%}#00/_60*{+!
</code></pre>

<p><a href="https://tio.run/##y0lMqizKzCvJ@P/f3ire0MBAtVbZwEA/3sxAq1pb8f9/Q0NDAA" rel="nofollow noreferrer" title="Labyrinth – Try It Online">Try it online!</a></p>

<h3>Explanation</h3>

<pre><code>?      Read input.
:      Duplicate.
_100%  Mod 100.
}      Move off to auxiliary stack.
#00/   Divide by 100, using the stack depth to get a 1, instead of _1.
_60*   Multiply by 60.
{+     Retrieve the earlier result and add it.
!      Print.
</code></pre>

<p>The IP then hits a dead end and starts moving backward. When it reaches the <code>/</code> it attempts a division by zero which terminates the program.</p>


blocks|key|162470|text|Excel，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|162471|匿名VBE即时窗口函数，它接受来自范围[A1]的输入并输出到VBE即时窗口。|unstyled|offset|length|style|CODE|162472|?[A1]Mod+1E2%2B60*[Int(A1/100)]|code-block|syntax|javascript|entityMap^0|0|J|4|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@$E|Q|F|R|G|H]]|9|@]|A|$]]|$1|I|3|J|5|K|7|S|8|@]|9|@]|A|$L|M]]]|N|$]]

<h1>Excel VBA, 29 Bytes</h1>

<p>Anonymous VBE immediate window function that takes input from range <code>[A1]</code> and outputs to the VBE immediate window.</p>
<pre class="lang-vb prettyprint-override"><code>?[A1]Mod 1E2+60*[Int(A1/100)]
</code></pre>


blocks|key|162540|text|帕里/GP，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162541|直率：|unstyled|162542|n->n\100*60%2Bn%25100|code-block|syntax|javascript|162543|不幸的是，这个很好的方法太长了，无法使用：|162544|n->[60,1]*divrem(n,100)|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/^0|0|5|0|0|0|0|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|$]]|$1|G|3|H|5|I|7|11|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|12|8|@]|9|@]|C|$]]|$1|N|3|O|5|I|7|13|8|@]|9|@]|C|$J|K]]]|P|$Q|$5|R|S|T|C|$U|V]]]]

<h1><a href="http://pari.math.u-bordeaux.fr/" rel="nofollow noreferrer">PARI/GP</a>, 16 bytes</h1>

<p>Straightforward:</p>

<pre><code>n-&gt;n\100*60+n%100
</code></pre>

<p>Unfortunately this nice method is simply too long to use:</p>

<pre><code>n-&gt;[60,1]*divrem(n,100)
</code></pre>


blocks|key|1300700|text|R，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300701|x=scan();x-x%25/%25100*40|code-block|syntax|javascript|1300702|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.r-project.org/|1|https://tio.run/##K/r/v8K2ODkxT0PTukK3QlVf1dDAQMvE4L8hlyEIgbEhlyWXJQiBseV/AA^0|0|1|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.r-project.org/" rel="nofollow noreferrer">R</a>, 21 bytes</h1>



<pre class="lang-r prettyprint-override"><code>x=scan();x-x%/%100*40
</code></pre>

<p><a href="https://tio.run/##K/r/v8K2ODkxT0PTukK3QlVf1dDAQMvE4L8hlyEIgbEhlyWXJQiBseV/AA" rel="nofollow noreferrer" title="R – Try It Online">Try it online!</a></p>


blocks|key|162650|text|通用Lisp，34个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|162651|(lambda(n)(-+n(*(floor+n+100)40)))|code-block|syntax|javascript|162652|在网上试试！|unstyled|offset|length|162653|@ovs公式的另一个港口。|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##S87JLC74r1FQlJlXoqDxXyMnMTcpJVEjT1NDVyFPQ0sjLSc/v0ghT8HQwEDTxEBTU/O/oaEhkAQA|1|https://codegolf.stackexchange.com/a/147787/52210^0|0|0|0|6|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@]|9|@$J|13|K|14|1|15]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]|U|$5|P|Q|R|A|$S|V]]]]

<h1>Common Lisp, 34 bytes</h1>
<pre><code>(lambda(n)(- n(*(floor n 100)40)))
</code></pre>
<p><a href="https://tio.run/##S87JLC74r1FQlJlXoqDxXyMnMTcpJVEjT1NDVyFPQ0sjLSc/v0ghT8HQwEDTxEBTU/O/oaEhkAQA" rel="nofollow noreferrer">Try it online!</a></p>
<p>Another port of <a href="https://codegolf.stackexchange.com/a/147787/52210">@ovs' formula</a>.</p>


blocks|key|162818|text|外壳，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162819|B60B100|code-block|syntax|javascript|162820|在网上试试！不是很令人兴奋，只是转换为基数100和返回从基数60。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/barbuz/Husk|1|https://tio.run/##yygtzv6fm18erPOoqfG/k5mBk6GBwf///6MNjYxNdCwtzM10DHUMQQiMDXUsdSxBCIwtYwE^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://github.com/barbuz/Husk" rel="nofollow noreferrer">Husk</a>, 7 bytes</h1>
<pre><code>B60B100
</code></pre>
<p><a href="https://tio.run/##yygtzv6fm18erPOoqfG/k5mBk6GBwf///6MNjYxNdCwtzM10DHUMQQiMDXUsdSxBCIwtYwE" rel="nofollow noreferrer" title="Husk – Try It Online">Try it online!</a> Not very exciting, just converts to base 100 and back from base 60.</p>


blocks|key|162871|text|空隙，45字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162872|在网上试试！|unstyled|162873|f:=function(t)+return+t-QuoInt(t,100)*40;end;|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gap-system.org/|1|https://tio.run/##JYwxDoMwEAR7XrGiwsiRbCkNWHkAHdRAEQUcubmLrPP7nROsdqac7/tXaxxfsdBHElMnBvmUkgnyWApPJJ1Y75zpny6cdIQaOUOQCKu38Be31IP@4taw4@AGujknLUXNW7QbtSY0rK0/^0|0|2|0|0|0|6|1|0^^$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|@$A|Z|B|10|1|11]]|C|$]]|$1|G|3|H|5|I|7|12|8|@]|9|@]|C|$J|K]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.gap-system.org/" rel="nofollow noreferrer">GAP</a>, 45 bytes</h1>
<p><a href="https://tio.run/##JYwxDoMwEAR7XrGiwsiRbCkNWHkAHdRAEQUcubmLrPP7nROsdqac7/tXaxxfsdBHElMnBvmUkgnyWApPJJ1Y75zpny6cdIQaOUOQCKu38Be31IP@4taw4@AGujknLUXNW7QbtSY0rK0/" rel="nofollow noreferrer">Try it online!</a></p>
<pre><code>f:=function(t) return t-QuoInt(t,100)*40;end;
</code></pre>


blocks|key|1300949|text|咬人，4字节(8字节)|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300950|`@60`@@|code-block|syntax|javascript|1300951|++++`@++++++#+convert+input+in+command-line+arg+to+base
++++++@+++++#+100+(default+value+for+@+when+no+input+from+STDIN)
`@++++++++++#+and+convert+from+base
++60++++++++#+60|1300952|📷|atomic|entityMap|0|LINK|mutability|MUTABLE|url|http://golfscript.com/nibbles/index.html|1|IMAGE|IMMUTABLE|imageUrl|https://i.stack.imgur.com/3ZLqv.png|imageAlt^0|0|2|0|0|0|0|0|1|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|F|7|15|8|@]|9|@]|C|$G|H]]|$1|K|3|L|5|M|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|V|Q|W|C|$X|Y|Z|-4]]]]

<h1><a href="http://golfscript.com/nibbles/index.html" rel="nofollow noreferrer">Nibbles</a>, 4 bytes (8 nibbles)</h1>
<pre><code>`@60`@@
</code></pre>
<pre><code>    `@      # convert input in command-line arg to base
      @     # 100 (default value for @ when no input from STDIN)
`@          # and convert from base
  60        # 60
</code></pre>
<p><a href="https://i.stack.imgur.com/3ZLqv.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/3ZLqv.png" alt="enter image description here" /></a></p>


blocks|key|1301045|text|朱莉娅1.0，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1301046|~x=x-x÷100*40|code-block|syntax|javascript|1301047|在网上试试！|unstyled|1301048|使用与Misha的TI-基解相同的算法。|1301049|Julia支持隐式乘法+(40x而不是40*x)，但它优先于大多数其他运算符。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|http://julialang.org/|1|https://tio.run/##PYxBCsIwEEXX5hSzbCWWhEoli4pbzyBSUhslUmJJIqQgvZYH8GA1iTazeu/z59@fveTUzfPkardxnzclZL0l8/WhwQpjmws3AqQCLXjXSyVMlqMVx9BgaKEGM/TSZqmZQ/Hag7FaqhtaOTz6ysC1EUV2VBbDyX@2Z79w4MYIbWFyUNcwIqE6hFJISxLiiZEZ/FG/QlGkiAsH2SUJVv2VeWY/irhwkKpMFpWU7As|2|https://codegolf.stackexchange.com/a/147783/114865|3|https://docs.julialang.org/en/v1/manual/integers-and-floating-point-numbers/#man-numeric-literal-coefficients^0|0|6|0|0|0|0|6|1|0|9|5|2|0|D|3|J|4|7|4|3^^$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|K|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|N|3|O|5|K|7|1H|8|@$A|1I|B|1J|P|Q]|$A|1K|B|1L|P|Q]]|9|@$A|1M|B|1N|1|1O]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]|12|$5|T|U|V|C|$W|13]]]]

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

<pre class="lang-julia prettyprint-override"><code>~x=x-x÷100*40
</code></pre>
<p><a href="https://tio.run/##PYxBCsIwEEXX5hSzbCWWhEoli4pbzyBSUhslUmJJIqQgvZYH8GA1iTazeu/z59@fveTUzfPkardxnzclZL0l8/WhwQpjmws3AqQCLXjXSyVMlqMVx9BgaKEGM/TSZqmZQ/Hag7FaqhtaOTz6ysC1EUV2VBbDyX@2Z79w4MYIbWFyUNcwIqE6hFJISxLiiZEZ/FG/QlGkiAsH2SUJVv2VeWY/irhwkKpMFpWU7As" rel="nofollow noreferrer" title="Julia 1.0 – Try It Online">Try it online!</a></p>
<p>Uses the same algorithm as Misha Lavrov's <a href="https://codegolf.stackexchange.com/a/147783/114865">TI-Basic solution</a>.</p>
<p>Julia supports <a href="https://docs.julialang.org/en/v1/manual/integers-and-floating-point-numbers/#man-numeric-literal-coefficients" rel="nofollow noreferrer">implicit multiplication</a> (<code>40x</code> instead of <code>40*x</code>), but it takes precedence over most other operators.</p>


blocks|key|161686|text|05AB1E，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161687|т÷60*¹т%25%2B|code-block|syntax|javascript|161688|在网上试试！|unstyled|161689|解释：|161690|т÷60*¹т%25%2B

т+++++++++//+Push+number+100
+÷++++++++//+Integer+division+with+the+input
++60++++++//+Push+number+60
++++*+++++//+Multiply+with+the+previous+result
+++++¹++++//+Push+input
++++++т+++//+Push+100+again
+++++++%25++//+Modulo
++++++++%2B+//+Add+the+first+and+the+second+result|161691|在05AB1E中可能有一些基本转换的技巧，但我找不到它。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##MzBNTDJM/f//YtPh7WYGWod2XmxS1f7/3xIIAA^0|0|6|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|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1B|8|@]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 9 bytes</h1>

<pre><code>т÷60*¹т%+
</code></pre>

<p><a href="https://tio.run/##MzBNTDJM/f//YtPh7WYGWod2XmxS1f7/3xIIAA" rel="nofollow noreferrer">Try it online!</a></p>

<p>Explanation:</p>

<pre><code>т÷60*¹т%+

т         // Push number 100
 ÷        // Integer division with the input
  60      // Push number 60
    *     // Multiply with the previous result
     ¹    // Push input
      т   // Push 100 again
       %  // Modulo
        + // Add the first and the second result
</code></pre>

<p>Probably there is some trick with base conversions which can be achieved in 05AB1E, but I couldn't find it.</p>


blocks|key|1300634|text|星河夹心牛奶巧克力，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300635|':Z/v40*-!|code-block|syntax|javascript|1300636|用法：./mw+code.mwg+-i+9999|unstyled|style|CODE|1300637|解释：|1300638|code+++++++explanation++++++++++++++++++++++++++stack

'++++++++++push+input+to+stack++++++++++++++++++[input]
+:+++++++++duplicate+ToS++++++++++++++++++++++++[input,+input]
++Z++++++++push+100+++++++++++++++++++++++++++++[input,+input,+100]
+++/v++++++integer+division+(divide+and+floor)++[input,+⌊input/100⌋]
+++++40++++push+40++++++++++++++++++++++++++++++[input,+⌊input/100⌋,+40]
+++++++*+++multiply+++++++++++++++++++++++++++++[input,+⌊input/100⌋*40]
++++++++-++subtract+++++++++++++++++++++++++++++[input+-+⌊input/100⌋*40]
+++++++++!+print|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/zachgates/Milky-Way^0|0|9|0|0|0|3|L|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]]|9|@]|C|$]]|$1|N|3|O|5|6|7|16|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|17|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]]]

<h1><a href="https://github.com/zachgates/Milky-Way" rel="nofollow noreferrer">Milky Way</a>, 10 bytes</h1>

<pre><code>':Z/v40*-!
</code></pre>

<p>usage: <code>./mw code.mwg -i 9999</code>  </p>

<h2>Explanation:</h2>

<pre><code>code       explanation                          stack

'          push input to stack                  [input]
 :         duplicate ToS                        [input, input]
  Z        push 100                             [input, input, 100]
   /v      integer division (divide and floor)  [input, ⌊input/100⌋]
     40    push 40                              [input, ⌊input/100⌋, 40]
       *   multiply                             [input, ⌊input/100⌋*40]
        -  subtract                             [input - ⌊input/100⌋*40]
         ! print
</code></pre>


blocks|key|1300756|text|REXX，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1300757|arg+t
say+t%25100*60%2Bt//100|code-block|syntax|javascript|1300758|(只是@ovs的另一个翻译)|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h2>REXX, 25 bytes</h2>

<pre><code>arg t
say t%100*60+t//100
</code></pre>

<p>(Just another translations of @ovs)</p>


blocks|key|1300790|text|05AB1E，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300791|т‰ć60*%2B|code-block|syntax|javascript|1300792|在网上试试！|unstyled|1300793|解释|1300794|+++++++++command++++++++++++++++++++++++++++++current+stack
т‰ć60*%2B++full+program.+push+input+implicitly++[1234]
т++++++++push+100+++++++++++++++++++++++++++++[1234]+[100]
+‰+++++++push+divmod++++++++++++++++++++++++++[12,+34]
++ć++++++push+head+extracted+(n[1:],+n[0])++++[34]+[12]
+++60*+++multiply+by+60+++++++++++++++++++++++[34]+[720]
++++++%2B++add+and+display+implicitly+++++++++++[754]|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##MzBNTDJM/f//YtOjhg1H2s0MtLT//zcEAgA^0|0|6|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="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 7 bytes</h1>

<pre><code>т‰ć60*+
</code></pre>

<p><a href="https://tio.run/##MzBNTDJM/f//YtOjhg1H2s0MtLT//zcEAgA" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>

<h1>Explanation</h1>

<pre><code>         command                              current stack
т‰ć60*+  full program. push input implicitly  [1234]
т        push 100                             [1234] [100]
 ‰       push divmod                          [12, 34]
  ć      push head extracted (n[1:], n[0])    [34] [12]
   60*   multiply by 60                       [34] [720]
      +  add and display implicitly           [754]
</code></pre>


blocks|key|163073|text|阿图罗，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|163074|$->t->t-40*t/100|code-block|syntax|javascript|163075|试试看|unstyled|163076|ovs‘Python回答的另一个端口。|entityMap|0|LINK|mutability|MUTABLE|url|https://arturo-lang.io/|1|http://arturo-lang.io/playground?KJXEFv|2|https://codegolf.stackexchange.com/a/147787/97916^0|0|3|0|0|0|0|3|1|0|4|8|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|@]|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|@$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="https://arturo-lang.io" rel="nofollow noreferrer">Arturo</a>, 16 bytes</h1>
<pre class="lang-arturo prettyprint-override"><code>$-&gt;t-&gt;t-40*t/100
</code></pre>
<p><a href="http://arturo-lang.io/playground?KJXEFv" rel="nofollow noreferrer">Try it</a></p>
<p>Another port of ovs' <a href="https://codegolf.stackexchange.com/a/147787/97916">Python answer</a>.</p>


blocks|key|1301180|text|德斯莫斯，20字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1301181|f(x)=x-40floor(.01x)|code-block|syntax|javascript|1301182|在德斯莫斯身上试试！|unstyled|1301183|的Python+2答案港|entityMap|0|LINK|mutability|MUTABLE|url|https://www.desmos.com/|1|https://www.desmos.com/calculator/wknlmc55uz|2|https://codegolf.stackexchange.com/a/147787/91262^0|0|4|0|0|0|0|A|1|0|0|B|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|@]|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|@$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="https://www.desmos.com" rel="nofollow noreferrer">Desmos</a>, 20 bytes</h1>
<pre><code>f(x)=x-40floor(.01x)
</code></pre>
<p><a href="https://www.desmos.com/calculator/wknlmc55uz" rel="nofollow noreferrer">Try it on Desmos!</a></p>
<p>Port of <a href="https://codegolf.stackexchange.com/a/147787/91262">ovs's Python 2 answer</a></p>


blocks|key|1301205|text|SageMath，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1301206|在SageMathCell上运行它！|unstyled|1301207|def+f(t):return+t-(t//100)*40|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|https://www.sagemath.org/|1|https://sagecell.sagemath.org/?z=eJxLSU1TSNMo0bQqSi0pLcpTKNHVKNHXNzQw0NQyMeDl4uVKyy9SKFHIzFOINtRRMARjCAEkLYEIjCGEZawVL5cCEBQUZeaVaICM1QQAk5gW4g==&lang=sage&interacts=eJyLjgUAARUAuQ==^0|0|8|0|0|0|I|1|0^^$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|@$A|Z|B|10|1|11]]|C|$]]|$1|G|3|H|5|I|7|12|8|@]|9|@]|C|$J|K]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.sagemath.org/" rel="nofollow noreferrer">SageMath</a>, 29 bytes</h1>
<p><a href="https://sagecell.sagemath.org/?z=eJxLSU1TSNMo0bQqSi0pLcpTKNHVKNHXNzQw0NQyMeDl4uVKyy9SKFHIzFOINtRRMARjCAEkLYEIjCGEZawVL5cCEBQUZeaVaICM1QQAk5gW4g==&amp;lang=sage&amp;interacts=eJyLjgUAARUAuQ==" rel="nofollow noreferrer">Run it on SageMathCell!</a></p>
<pre><code>def f(t):return t-(t//100)*40
</code></pre>


<p>I'm hungry. Let's microwave something. Given a numerical input of between 1 and 4 digits, output the number of seconds that the microwave should run.</p>
<h2>Details</h2>
<p>The trick is figuring out if the user is inputting seconds or a combination of seconds and minutes. The ones and the tens places should be interpreted as seconds and the hundreds and thousands places should be minutes. For example, the value <code>1234</code> should be interpreted as 12 minutes, 34 seconds and <code>9876</code> should be 98 minutes, 76 seconds. Typing <code>130</code> and <code>90</code> should both result in a cook time of 90 seconds.</p>
<p>Here are a few other inputs and outputs:</p>
<ul>
<li>1 = 1</li>
<li>11 = 11</li>
<li>111 = 71</li>
<li>1111 = 671</li>
<li>9 = 9</li>
<li>99 = 99</li>
<li>999 = 639</li>
<li>9999 = 6039</li>
</ul>
<h2>Rules</h2>
<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 the shortest program in bytes wins. Standard loopholes are not allowed. The winning entry must return the right answer when given any integer input from 1 to 9999.</p>


How long should my microwave run?

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

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

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

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

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

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

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

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

我饿了。我们用微波炉吧。给定1到4位之间的数字输入，输出微波应该运行的秒数。详细信息诀窍是找出用户是在输入秒，还是输入秒和分钟的组合。一位和十位应该被解释为秒，而数以万计的位置应该是分钟。例如，1234值应该被解释为12分钟34秒，而9876应该是98分76秒。输入130和90将导致90秒的烹饪时间。以下是其他一些投入和产出：1=111 = 11111 = 711111 = 6719=999 = 

问我的微波炉要用多长时间？
EN

详细信息

规则

回答 30

Code Golf用户

Python 2，19字节

Code Golf用户

杰夫特，6字节

Code Golf用户

TI-Basic (83系列)，8字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问我的微波炉要用多长时间？EN

详细信息

规则

回答 30

Code Golf用户

Python 2，19字节

Code Golf用户

杰夫特，6字节

Code Golf用户

TI-Basic (83系列)，8字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问我的微波炉要用多长时间？
EN