Expand and ContractExpand tabs (implement expand(1))Decimal concatenation of squaresExpand the numberEvaluate...

How do conventional missiles fly?

Venezuelan girlfriend wants to travel the USA to be with me. What is the process?

Avoiding the "not like other girls" trope?

How to stretch the corners of this image so that it looks like a perfect rectangle?

Is it possible to create a QR code using text?

In the UK, is it possible to get a referendum by a court decision?

How to compactly explain secondary and tertiary characters without resorting to stereotypes?

Fair gambler's ruin problem intuition

What reasons are there for a Capitalist to oppose a 100% inheritance tax?

meaning of 腰を落としている

How do I exit BASH while loop using modulus operator?

How can saying a song's name be a copyright violation?

Is there a hemisphere-neutral way of specifying a season?

How can a day be of 24 hours?

What Exploit Are These User Agents Trying to Use?

What are the G forces leaving Earth orbit?

Is this draw by repetition?

Why is the sentence "Das ist eine Nase" correct?

Using "tail" to follow a file without displaying the most recent lines

How seriously should I take size and weight limits of hand luggage?

Can I hook these wires up to find the connection to a dead outlet?

Why do I get negative height?

What exactly is ineptocracy?

Description list Formatting using enumitem



Expand and Contract


Expand tabs (implement expand(1))Decimal concatenation of squaresExpand the numberEvaluate a Dice 10,000 rollExpand ExponentiationExpand that Australian stateExpand a numberExpand Sine and CosineExpand some numberCompound interest with additions













6












$begingroup$


Take a positive integer $k$ as input. Start with $n := 1$ and repeatedly increase $n$ by the largest integer power of ten $i$ such that $i le n$ and $i + n le k$.



Repeat until $n = k$ and return a list of all intermediate values of $n$, including both the initial $1$ and the final $k$.



During this process, growth will initially be limited by the former inequality, and only afterwards by the latter; the growth will take the form of an initial "expansion" period, during which $n$ is increased by ever-larger powers, followed by a "contract" period, during which $n$ is increased by ever-smaller powers in order to "zoom in" on the correct number.



Test Cases



1 => [1]
10 => [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
321 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
10, 20, 30, 40, 50, 60, 70, 80, 90,
100, 200, 300, 310, 320, 321]
1002 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
10, 20, 30, 40, 50, 60, 70, 80, 90,
100, 200, 300, 400, 500, 600, 700, 800, 900,
1000, 1001, 1002]


This is code-golf, so the shortest answer (in bytes) wins.










share|improve this question









$endgroup$

















    6












    $begingroup$


    Take a positive integer $k$ as input. Start with $n := 1$ and repeatedly increase $n$ by the largest integer power of ten $i$ such that $i le n$ and $i + n le k$.



    Repeat until $n = k$ and return a list of all intermediate values of $n$, including both the initial $1$ and the final $k$.



    During this process, growth will initially be limited by the former inequality, and only afterwards by the latter; the growth will take the form of an initial "expansion" period, during which $n$ is increased by ever-larger powers, followed by a "contract" period, during which $n$ is increased by ever-smaller powers in order to "zoom in" on the correct number.



    Test Cases



    1 => [1]
    10 => [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
    321 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
    10, 20, 30, 40, 50, 60, 70, 80, 90,
    100, 200, 300, 310, 320, 321]
    1002 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
    10, 20, 30, 40, 50, 60, 70, 80, 90,
    100, 200, 300, 400, 500, 600, 700, 800, 900,
    1000, 1001, 1002]


    This is code-golf, so the shortest answer (in bytes) wins.










    share|improve this question









    $endgroup$















      6












      6








      6





      $begingroup$


      Take a positive integer $k$ as input. Start with $n := 1$ and repeatedly increase $n$ by the largest integer power of ten $i$ such that $i le n$ and $i + n le k$.



      Repeat until $n = k$ and return a list of all intermediate values of $n$, including both the initial $1$ and the final $k$.



      During this process, growth will initially be limited by the former inequality, and only afterwards by the latter; the growth will take the form of an initial "expansion" period, during which $n$ is increased by ever-larger powers, followed by a "contract" period, during which $n$ is increased by ever-smaller powers in order to "zoom in" on the correct number.



      Test Cases



      1 => [1]
      10 => [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
      321 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
      10, 20, 30, 40, 50, 60, 70, 80, 90,
      100, 200, 300, 310, 320, 321]
      1002 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
      10, 20, 30, 40, 50, 60, 70, 80, 90,
      100, 200, 300, 400, 500, 600, 700, 800, 900,
      1000, 1001, 1002]


      This is code-golf, so the shortest answer (in bytes) wins.










      share|improve this question









      $endgroup$




      Take a positive integer $k$ as input. Start with $n := 1$ and repeatedly increase $n$ by the largest integer power of ten $i$ such that $i le n$ and $i + n le k$.



      Repeat until $n = k$ and return a list of all intermediate values of $n$, including both the initial $1$ and the final $k$.



      During this process, growth will initially be limited by the former inequality, and only afterwards by the latter; the growth will take the form of an initial "expansion" period, during which $n$ is increased by ever-larger powers, followed by a "contract" period, during which $n$ is increased by ever-smaller powers in order to "zoom in" on the correct number.



      Test Cases



      1 => [1]
      10 => [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
      321 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
      10, 20, 30, 40, 50, 60, 70, 80, 90,
      100, 200, 300, 310, 320, 321]
      1002 => [1, 2, 3, 4, 5, 6, 7, 8, 9,
      10, 20, 30, 40, 50, 60, 70, 80, 90,
      100, 200, 300, 400, 500, 600, 700, 800, 900,
      1000, 1001, 1002]


      This is code-golf, so the shortest answer (in bytes) wins.







      code-golf number decimal






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 1 hour ago









      Esolanging FruitEsolanging Fruit

      8,65932774




      8,65932774






















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$


          Python 2, 61 bytes





          f=lambda k,n=1:n<k and[n]+f(k,n+10**~-len(`min(n,k-n)`))or[n]


          Try it online!






          share|improve this answer











          $endgroup$





















            2












            $begingroup$


            Perl 6, 48 41 bytes





            ->k{1,{$_+10**min($_,k-$_).comb/10}...k}


            Try it online!



            Explanation:



            ->k{                                   }  # Anonymous code block taking k
            1, ...k # Start a sequence from 1 to k
            { } # Where each element is
            $_+ # The previous element plus
            10** # 10 to the power of
            .comb # The length of
            min($_,k-$_) # The min of the current count and the remainder
            /10 # Minus one





            share|improve this answer











            $endgroup$














              Your Answer





              StackExchange.ifUsing("editor", function () {
              return StackExchange.using("mathjaxEditing", function () {
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
              });
              });
              }, "mathjax-editing");

              StackExchange.ifUsing("editor", function () {
              StackExchange.using("externalEditor", function () {
              StackExchange.using("snippets", function () {
              StackExchange.snippets.init();
              });
              });
              }, "code-snippets");

              StackExchange.ready(function() {
              var channelOptions = {
              tags: "".split(" "),
              id: "200"
              };
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function() {
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled) {
              StackExchange.using("snippets", function() {
              createEditor();
              });
              }
              else {
              createEditor();
              }
              });

              function createEditor() {
              StackExchange.prepareEditor({
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader: {
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              },
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              });


              }
              });














              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f182569%2fexpand-and-contract%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              3












              $begingroup$


              Python 2, 61 bytes





              f=lambda k,n=1:n<k and[n]+f(k,n+10**~-len(`min(n,k-n)`))or[n]


              Try it online!






              share|improve this answer











              $endgroup$


















                3












                $begingroup$


                Python 2, 61 bytes





                f=lambda k,n=1:n<k and[n]+f(k,n+10**~-len(`min(n,k-n)`))or[n]


                Try it online!






                share|improve this answer











                $endgroup$
















                  3












                  3








                  3





                  $begingroup$


                  Python 2, 61 bytes





                  f=lambda k,n=1:n<k and[n]+f(k,n+10**~-len(`min(n,k-n)`))or[n]


                  Try it online!






                  share|improve this answer











                  $endgroup$




                  Python 2, 61 bytes





                  f=lambda k,n=1:n<k and[n]+f(k,n+10**~-len(`min(n,k-n)`))or[n]


                  Try it online!







                  share|improve this answer














                  share|improve this answer



                  share|improve this answer








                  edited 37 mins ago

























                  answered 43 mins ago









                  Chas BrownChas Brown

                  5,0991523




                  5,0991523























                      2












                      $begingroup$


                      Perl 6, 48 41 bytes





                      ->k{1,{$_+10**min($_,k-$_).comb/10}...k}


                      Try it online!



                      Explanation:



                      ->k{                                   }  # Anonymous code block taking k
                      1, ...k # Start a sequence from 1 to k
                      { } # Where each element is
                      $_+ # The previous element plus
                      10** # 10 to the power of
                      .comb # The length of
                      min($_,k-$_) # The min of the current count and the remainder
                      /10 # Minus one





                      share|improve this answer











                      $endgroup$


















                        2












                        $begingroup$


                        Perl 6, 48 41 bytes





                        ->k{1,{$_+10**min($_,k-$_).comb/10}...k}


                        Try it online!



                        Explanation:



                        ->k{                                   }  # Anonymous code block taking k
                        1, ...k # Start a sequence from 1 to k
                        { } # Where each element is
                        $_+ # The previous element plus
                        10** # 10 to the power of
                        .comb # The length of
                        min($_,k-$_) # The min of the current count and the remainder
                        /10 # Minus one





                        share|improve this answer











                        $endgroup$
















                          2












                          2








                          2





                          $begingroup$


                          Perl 6, 48 41 bytes





                          ->k{1,{$_+10**min($_,k-$_).comb/10}...k}


                          Try it online!



                          Explanation:



                          ->k{                                   }  # Anonymous code block taking k
                          1, ...k # Start a sequence from 1 to k
                          { } # Where each element is
                          $_+ # The previous element plus
                          10** # 10 to the power of
                          .comb # The length of
                          min($_,k-$_) # The min of the current count and the remainder
                          /10 # Minus one





                          share|improve this answer











                          $endgroup$




                          Perl 6, 48 41 bytes





                          ->k{1,{$_+10**min($_,k-$_).comb/10}...k}


                          Try it online!



                          Explanation:



                          ->k{                                   }  # Anonymous code block taking k
                          1, ...k # Start a sequence from 1 to k
                          { } # Where each element is
                          $_+ # The previous element plus
                          10** # 10 to the power of
                          .comb # The length of
                          min($_,k-$_) # The min of the current count and the remainder
                          /10 # Minus one






                          share|improve this answer














                          share|improve this answer



                          share|improve this answer








                          edited 32 mins ago

























                          answered 56 mins ago









                          Jo KingJo King

                          26.3k364129




                          26.3k364129






























                              draft saved

                              draft discarded




















































                              If this is an answer to a challenge…




                              • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                              • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                                Explanations of your answer make it more interesting to read and are very much encouraged.


                              • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



                              More generally…




                              • …Please make sure to answer the question and provide sufficient detail.


                              • …Avoid asking for help, clarification or responding to other answers (use comments instead).





                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f182569%2fexpand-and-contract%23new-answer', 'question_page');
                              }
                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              VNC viewer RFB protocol error: bad desktop size 0x0I Cannot Type the Key 'd' (lowercase) in VNC Viewer...

                              Couldn't open a raw socket. Error: Permission denied (13) (nmap)Is it possible to run networking commands...

                              Why not use the yoke to control yaw, as well as pitch and roll? Announcing the arrival of...