Shifting digits

Question

Given a string representing a number and the base that number is in, shift each positional value upward, wrapping back to zero if the value cannot increase. You will never be provided invalid input, nor a base larger than 36.

For example, you may be provided ['5f6', '16'], which represents the number 1526 in base 16. The expected output in that case would be '607' (1543 in base 16).

Input

program: separate lines from STDIN: '5f6\n16'
function: a tuple or array: f(['5f6', '16']) or f(['5f6', 16])
function: two arguments f('5f6', '16') or f('5f6', 16)

Output

program: to STDOUT: 607
function: returned as a string: '607'

Test cases

['5f6', '16']
'607'

['abc', '36']
'bcd'

['1', '1'] or ['0', '1']
'1' or '0'

['9540', '10']
'0651' or '651'

['001', '2']
'110'

Is the input format that strict, or can I take the input for my program as, say, "5f6"\n16? — ETHproductions, Sep 1 '17 at 1:02
You haven't specified what base 1 input will look like. Since unary isn't a positional number system I wouldn't require supporting it if I were you, but if you do you should specify what digit is used. — Jakob, Sep 2 '17 at 23:50

betaveros · Accepted Answer · 2017-09-01 02:42:52Z

Paradoc (v0.2.10), 10 bytes (CP-1252)

DaÅ+<:<oTr

Try it online!

Takes the string and the base as an integer from the stack, results in a string on the stack.

Whoops, I don't know why I don't have a 0-9A-Z constant yet. It would shave two bytes. (Assumes input is uppercase; for lowercase replace Å with La.)

Explanation:

Da         .. Push the digit alphabet
  Å        .. Push the uppercase alphabet
   +       .. Concatenate them
    <      .. Take the slice of the first (base) characters
     :     .. Duplicate
      <o   .. Left-rotate by one
        Tr .. Translate through the last two strings

ETHproductions · Accepted Answer · 2017-09-02 20:31:04Z

Japt, 10 bytes

®nV Ä sV Ì

Test it online!

The 3-byters nV and sV are rather annoying...

Explanation

 ®   nV Ä  sV Ì     
UmZ{ZnV +1 sV gJ}   Ungolfed
                    Implicit: U = input string, V = base
UmZ{            }   Map each char in Z to
    ZnV               Z converted from base V to decimal,
        +1            plus 1,
           sV         converted back to base V,
              gJ      and shortened to only the last char. (J = -1)
                    Implicit: output result of last expression

Chas Brown · Accepted Answer · 2017-09-01 02:26:46Z

3

Python 2, 77 74 72 bytes

lambda s,m:''.join(chr(c+[48,55][c>9])for c in[-~int(x,m)%m for x in s])

Try it online!

Takes a string and an int base. Works up to base 36.

edited Sep 1 '17 at 2:26

answered Sep 1 '17 at 1:21

Chas Brown

9,4791 gold badge9 silver badges38 bronze badges

\$\begingroup\$ 69 bytes \$\endgroup\$ – ovs Sep 1 '17 at 9:33

Add a comment |

tsh · Accepted Answer · 2017-09-01 03:48:09Z

3

JavaScript, 57 bytes

(a,b)=>a.replace(/./g,v=>(-~parseInt(v,b)%b).toString(b))

edited Sep 1 '17 at 3:48

answered Sep 1 '17 at 1:26

tsh

18.8k2 gold badges20 silver badges79 bronze badges

1

\$\begingroup\$ Save a byte with currying: a=>b=> \$\endgroup\$ – Shaggy Sep 1 '17 at 13:51
\$\begingroup\$ This doesn't function with base 1 \$\endgroup\$ – Bálint Sep 1 '17 at 16:34
1

\$\begingroup\$ @Bálint I wouldn't expect any solution to work with base 1... \$\endgroup\$ – ETHproductions Sep 1 '17 at 21:05
\$\begingroup\$ @ETHproductions Quoting one of the comments from OP "Base 1 is also an acceptable input" \$\endgroup\$ – Bálint Sep 1 '17 at 21:39
\$\begingroup\$ @Bálint: Acceptable, not required. Also, comments do not a spec make. \$\endgroup\$ – Shaggy Sep 2 '17 at 1:11

| Show 5 more comments

FryAmTheEggman · Accepted Answer · 2017-09-01 13:44:28Z

3

Pyth, 11 10 bytes

.rE<+jkUTG

Try it here

Thanks to Mr. XCoder for saving 1 byte!

We use .r to cyclically rotate over the alphabet of the given base. We build that using G as the built in alphabet, and then a range of numbers, and slicing off the excess.

edited Sep 1 '17 at 13:44

answered Sep 1 '17 at 3:19

FryAmTheEggman

16.7k3 gold badges32 silver badges90 bronze badges

\$\begingroup\$ The notification I got of your answer said "Pyth, 0 bytes" and I almost did a spit take! 11 bytes is still great, though. :-) \$\endgroup\$ – Zach Gates Sep 1 '17 at 3:21
\$\begingroup\$ @ZachGates Haha, that was caused by me copying an empty TIO body link and then filling it out to save me the trouble of typesetting the answer. Unfortunately I forgot to change the byte count, but the edit that happened in the grace period doesn't get reflected in the notification I think. I hope I didn't startle you too much :P \$\endgroup\$ – FryAmTheEggman Sep 1 '17 at 3:23
1

\$\begingroup\$ 10 bytes (.rE<+jkUTG). I have absolutely no idea why you have a J in there, as you only use it once. \$\endgroup\$ – Mr. Xcoder Sep 1 '17 at 8:45
\$\begingroup\$ @Mr.Xcoder Whoa, I guess that's what golfing at 1am does to someone. \$\endgroup\$ – FryAmTheEggman Sep 1 '17 at 13:43

Add a comment |

Leaky Nun · Accepted Answer · 2017-09-03 03:42:15Z

3

Jelly, 15 12 bytes

3 bytes thanks to Jonathan Allan.

ØBiÐ€⁸%⁹‘ịØB

Try it online!

How it works

ØBiÐ€⁸%⁹‘ịØB
ØB           "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  iÐ€⁸       index of each in first input
      %⁹     modulo the second input
        ‘    increase by 1
         ị   index into
          ØB "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"

edited Sep 3 '17 at 3:42

answered Sep 1 '17 at 1:58

Leaky Nun

46.5k5 gold badges95 silver badges270 bronze badges

\$\begingroup\$ ØBiÐ€⁸%⁹‘ịØB for 12 bytes (uppercase acceptable) \$\endgroup\$ – Jonathan Allan Sep 2 '17 at 1:19
\$\begingroup\$ Nice answer, +1. Guess you wish Jelly had builtins for string <-> number base conversions, though, huh? Also, can you please explain how this works (mainly the order in which it's parsed)? \$\endgroup\$ – Adalynn Sep 2 '17 at 22:30
\$\begingroup\$ @Zacharý added. \$\endgroup\$ – Leaky Nun Sep 3 '17 at 3:42

Add a comment |

Steadybox · Accepted Answer · 2017-09-01 17:10:01Z

2

C, 75 74 65 bytes

Thanks to @tsh for saving 9 bytes!

f(n,b)char*n;{for(;*n;++n)*n=*n-b-(b>10?86:47)?*n-57?*n+1:97:48;}

Modifies the input string directly.

Try it online!

edited Sep 1 '17 at 17:10

answered Sep 1 '17 at 1:51

Steadybox

16.1k5 gold badges34 silver badges83 bronze badges

Add a comment |

Erik the Outgolfer · Accepted Answer · 2017-09-01 09:08:20Z

1

05AB1E, 10 bytes

ö¹в>¹%¹β¹B

Try it online!

answered Sep 1 '17 at 9:08

Erik the Outgolfer

39.4k5 gold badges34 silver badges117 bronze badges

\$\begingroup\$ This seems pretty fitting, as 05AB1E came from base. Also, can you add an explanation of what all those b's mean? \$\endgroup\$ – Adalynn Sep 2 '17 at 22:33
\$\begingroup\$ @Zacharý They're all base stuff including the ö :p \$\endgroup\$ – Erik the Outgolfer Sep 3 '17 at 12:05

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Haskell, 65 64 59 bytes

map.(%)
b%c|mod(fromEnum c-b)39==8='0'
_%'9'='a'
_%c=succ c

Try it online! Usage: map.(%) $ 16 "5f6" yields "607".

Edit: -1 byte thanks to nimi, -5 bytes thanks to Ørjan Johansen.

edited Jun 17 '20 at 9:04

Community♦

1

answered Sep 1 '17 at 9:17

Laikoni

24.4k4 gold badges47 silver badges108 bronze badges

1

\$\begingroup\$ A multiline definition of % saves a byte. \$\endgroup\$ – nimi Sep 1 '17 at 13:39
\$\begingroup\$ @nimi Thanks! It's always nicer to have powers of 2 as byte count. \$\endgroup\$ – Laikoni Sep 1 '17 at 14:58
1

\$\begingroup\$ A shorter test for the second line: mod(fromEnum c-b)39==8. \$\endgroup\$ – Ørjan Johansen Sep 2 '17 at 1:09
\$\begingroup\$ @ØrjanJohansen Thanks! Switching to upper-case letters even saves another byte. \$\endgroup\$ – Laikoni Sep 2 '17 at 7:52
\$\begingroup\$ Um you cannot use upper-case letters for this trick - the modulus needs to be larger than the highest base supported, otherwise it gives false positives. \$\endgroup\$ – Ørjan Johansen Sep 2 '17 at 8:21

| Show 1 more comment

Community · Accepted Answer · 2020-06-17 09:04:33Z

MY, 8 bytes

αωP‘%pέ←

I definitely made the right choice adding the basify (P) and stringify (p) atoms!

Try it online!

How it works, along with a reason for the codepoint

α, push the second command line argument (taken from APL, but it's the greek symbol instead of the APL one)
ω, push the first command line argument (also taken from APL)
P, pop n; push n basified (0-Z => 0-35, b flipped is p)
‘, pop n; push n + 1 (vectorizes ["vecifies" in MY], taken from jelly)
%, pop a; pop b; push a%b (vecifies, do I really need to give this to you?)
p, pop n; push n stringified (0-35 => 0-Z, vecifies, same origin as P)
έ, pop n; push "".join(n) (ε is the empty string, and just put an accent mark over it)
←, pop n; output n with no newline. (Pushing it away from the stack to STDOUT)

THIS is what MY was meant for!

I can't believe MY is outgolfing the language named after base! — Adalynn, Sep 3 '17 at 0:48

640KB · Accepted Answer · 2019-08-09 21:13:43Z

1

PHP, 83 bytes

while(($c=$argv[1][$i++])>'')echo base_convert(intval($c,$b=$argv[2])+1,10,$b)[-1];

Try it online!

answered Aug 9 '19 at 21:13

640KB

10.3k1 gold badge23 silver badges49 bronze badges

Add a comment |

ZaMoC · Accepted Answer · 2017-09-01 02:27:19Z

0

Mathematica, 62 bytes

(h=#2;""<>ToString/@(Mod[#~FromDigits~h+1,h]&/@Characters@#))&

Try it online!

edited Sep 1 '17 at 2:27

answered Sep 1 '17 at 1:34

ZaMoC

21.8k2 gold badges26 silver badges72 bronze badges

Add a comment |

YetiCGN · Accepted Answer · 2017-09-01 18:42:03Z

0

PHP, 87 bytes

list(,$a,$b)=$argv;for(;$c=intval($a{$i++},$b);)echo$b>1?base_convert(++$c%$b,10,$b):1;

Run with -r like this:

php -r "list(,$a,$b)=$argv;for(;$c=intval($a{$i++},$b);)echo$b>1?base_convert(++$c%$b,10,$b):1;" xyz 36

Works with bases 1 to 36, inclusive.

answered Sep 1 '17 at 18:42

YetiCGN

9815 silver badges8 bronze badges

Add a comment |

Justin Mariner · Accepted Answer · 2017-09-02 03:45:21Z

0

Bash, 71 bytes

b=({0..9} {a..z})
for c in `fold -w1<<<$1`;{ echo -n ${b[-~$2#$c%$2]};}

Try it online!

answered Sep 2 '17 at 3:45

Justin Mariner

4,8261 gold badge9 silver badges18 bronze badges

Add a comment |

Zach Gates · Accepted Answer · 2017-09-03 00:41:34Z

0

Python, 81 78 74 87 86 bytes

import string
lambda a,b:''.join(string.printable[-~int(i,b)%b]for i in a)if b>1else a

Alternatively:

lambda a,b:''.join(__import__('string').printable[-~int(i,b)%b]for i in a)if b>1else a

edited Sep 3 '17 at 0:41

answered Sep 1 '17 at 1:27

Zach Gates

6,37423 silver badges75 bronze badges

\$\begingroup\$ f('6f3', '32') get wrong output '7164' \$\endgroup\$ – tsh Sep 1 '17 at 1:31
\$\begingroup\$ @tsh: Absolutely right. Fixed. \$\endgroup\$ – Zach Gates Sep 1 '17 at 1:38
\$\begingroup\$ (x+1)%y -> -~x%y, \$\endgroup\$ – tsh Sep 1 '17 at 1:51
\$\begingroup\$ @tsh: Beat me to it. I was trying to figure out that bit flip right now. Thanks :-) \$\endgroup\$ – Zach Gates Sep 1 '17 at 1:51
\$\begingroup\$ What is [:b] used? \$\endgroup\$ – tsh Sep 1 '17 at 1:56

| Show 3 more comments

user886 · Accepted Answer · 2017-09-03 16:18:50Z

0

Ruby, 53 59 bytes

->n,b{b<2?n:n.chars.map{|c|(c.to_i(b)+1).to_s(b)[-1]}.join}

Try it online!

Originally 6 bytes less, but Ruby doesn't like using a base of 1.

Could save 5 bytes by removing .join if the output did not need to be a string.

edited Sep 3 '17 at 16:18

answered Sep 1 '17 at 6:34

user886

1115 bronze badges

\$\begingroup\$ You can remove two spaces from the start. \$\endgroup\$ – Erik the Outgolfer Sep 3 '17 at 12:05

Add a comment |

Neil · Accepted Answer · 2017-12-26 10:03:24Z

Charcoal, 23 21 bytes

≔…⁺⪫ＥχＩιωβＮθＦＳ§θ⁺¹⌕θι

Try it online! Link is to verbose version of code. Edit: Saved 2 bytes by using CycleChop instead of Slice. Explanation:

    Ｅχ                  Loop over the digits
      Ｉι                Cast to string
   ⪫    ω               Join together
  ⁺      β              Append the lowercase letters
          Ｎ             First input as a number
 …                      Take `n` characters from the start
≔          θ            Assign to variable `q`
            ＦＳ          Loop over the characters in the second input
                  ⌕θι   Find the character index in `q`
                ⁺¹      Plus 1
              §θ        Cyclically index in `q`
                        Implicitly print

Note: Later versions of Charcoal reduce this to 20 bytes: ≔…⁺⪫ＥχＩιωβＮθＦＳ§θ⊕⌕θι

use the AST to help explain when the deverbosifier is out of order :P (also yeah i came across that bug too whoops) — ASCII-only, Sep 7 '17 at 6:23

Xcali · Accepted Answer · 2019-08-09 22:41:48Z

0

Perl 5 `-lF`, 61 53 bytes

$l=(0..9,a..z,aa)[<>];say map{++$_;/$l/?0:s/10/a/r}@F

Try it online!

edited Aug 9 '19 at 22:41

answered Sep 6 '17 at 20:20

Xcali

11.6k2 gold badges9 silver badges31 bronze badges

Add a comment |

recursive · Accepted Answer · 2019-08-10 00:13:08Z

0

Stax, 6 bytes

╕W─░ì]

Run and debug it

Procedure:

Push constant "0123456789abcdefghijklmnopqrstuvwxyz".
Get and eval base, now two spots down the stack
Truncate digit string to specified count.
"Ring" translate using remaining characters. This maps each character to the next, wrapping around to "0" at the end.

answered Aug 10 '19 at 0:13

recursive

9,50917 silver badges33 bronze badges

Add a comment |

Stack Exchange Network

current community

your communities

more stack exchange communities

Shifting digits

Input

Output

Test cases

19 Answers 19

Paradoc (v0.2.10), 10 bytes (CP-1252)

Japt, 10 bytes

Explanation

Python 2, 77 74 72 bytes

JavaScript, 57 bytes

Pyth, 11 10 bytes

Jelly, 15 12 bytes

How it works

C, 75 74 65 bytes

05AB1E, 10 bytes

Haskell, 65 64 59 bytes

MY, 8 bytes

How it works, along with a reason for the codepoint

PHP, 83 bytes

Mathematica, 62 bytes

PHP, 87 bytes

Bash, 71 bytes

Python, 81 78 74 87 86 bytes

Ruby, 53 59 bytes

Charcoal, 23 21 bytes

Perl 5 `-lF`, 61 53 bytes

Stax, 6 bytes

Procedure:

Your Answer

Not the answer you're looking for? Browse other questions tagged code-golf number or ask your own question.

Hot Network Questions

Shifting digits

Input

Output

Test cases

19 Answers 19

Paradoc (v0.2.10), 10 bytes (CP-1252)

Japt, 10 bytes

Explanation

Python 2, 77 74 72 bytes

JavaScript, 57 bytes

Pyth, 11 10 bytes

Jelly, 15 12 bytes

How it works

C, 75 74 65 bytes

05AB1E, 10 bytes

Haskell, 65 64 59 bytes

MY, 8 bytes

How it works, along with a reason for the codepoint

PHP, 83 bytes

Mathematica, 62 bytes

PHP, 87 bytes

Bash, 71 bytes

Python, 81 78 74 87 86 bytes

Ruby, 53 59 bytes

Charcoal, 23 21 bytes

Perl 5 -lF, 61 53 bytes

Stax, 6 bytes

Procedure:

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golf number or ask your own question.

Related

Hot Network Questions

Perl 5 `-lF`, 61 53 bytes