Up go the bits!

Question

Given an integer N perform the following steps: (using 9 as an example).

Receive input N. (9)
Convert N from base10 to base2. (1001)
Increase every bit by 1. (2112)
Treat the result as base3 and convert it back to base10. (68)
Return/Output the result.

Input

May be received in any reasonable number format.
You only need to handle cases where N > 0.

Output

Either return as a number or string, or print to stdout.

Rules

This is code-golf, the shortest code in bytes wins.
Default loopholes are forbidden.

Test Cases

1 -> 2
2 -> 7
5 -> 23
9 -> 68
10 -> 70
20 -> 211
1235 -> 150623
93825 -> 114252161

Dennis · Accepted Answer · 2018-04-09 13:06:03Z

15

Python 2, 31 bytes

f=lambda n:n and 3*f(n/2)+n%2+1

Try it online!

answered Apr 9, 2018 at 13:06

Dennis

210k41 gold badges370 silver badges823 bronze badges

3

\$\begingroup\$ Could you explain how this works? \$\endgroup\$
– user79760
Apr 10, 2018 at 18:26
\$\begingroup\$ +n%2+1 adds the rightmost binary bit plus 1 to the return value, n/2 right-shifts n by 1 binary bit, 3*f(n/2) recursively adds 3 times this computation on those right-shifted bits, and n and ends the recursion when n is 0 \$\endgroup\$
– Noodle9
Apr 11, 2018 at 11:52

Add a comment |

l4m2 · Accepted Answer · 2018-04-09 13:32:52Z

11

JavaScript (Node.js), 23 bytes

f=x=>x&&x%2+1+3*f(x>>1)

Try it online!

edited Apr 9, 2018 at 13:32

answered Apr 9, 2018 at 12:45

l4m2

23.9k2 gold badges23 silver badges91 bronze badges

\$\begingroup\$ x>>1 is the same as x/2 isn't it? \$\endgroup\$
– mbomb007
Apr 9, 2018 at 13:16
\$\begingroup\$ @mbomb007 I thought and suggested the same just yet, but apparently it becomes Infinity in JS.. Try it online. (You might want to add a TIO-link to you answer, I4m2) \$\endgroup\$
– Kevin Cruijssen
Apr 9, 2018 at 13:23
2

\$\begingroup\$ @mbomb007 No. 1>>1=0 while 1/2=0.5 \$\endgroup\$
– l4m2
Apr 9, 2018 at 13:24
4

\$\begingroup\$ @mbomb007 ... Python? \$\endgroup\$
– DELETE_ME
Apr 9, 2018 at 14:11
2

\$\begingroup\$ Yeah. Look at the Python answer. That's the reason n/2 works in that one, and the reason I suggested it here. \$\endgroup\$
– mbomb007
Apr 9, 2018 at 16:16

| Show 1 more comment

DELETE_ME · Accepted Answer · 2018-04-09 12:56:22Z

9

Java (JDK 10), 44 bytes

long n(long x){return x<1?0:x%2+1+3*n(x/2);}

Try it online!

answered Apr 9, 2018 at 12:56

DELETE_ME

17.3k2 gold badges36 silver badges70 bronze badges

1

\$\begingroup\$ Maybe -~ will help? \$\endgroup\$
– DELETE_ME
Apr 9, 2018 at 12:57
2

\$\begingroup\$ No, precedence rules. \$\endgroup\$
– DELETE_ME
Apr 9, 2018 at 12:58
\$\begingroup\$ Same question to you: why long? :) And here I thought my sequence approach was smart.. You blew it out of the park in less than 5 minutes.. >.> :'( \$\endgroup\$
– Kevin Cruijssen
Apr 9, 2018 at 13:00
\$\begingroup\$ @KevinCruijssen To be fair with you ... \$\endgroup\$
– DELETE_ME
Apr 9, 2018 at 13:59

Add a comment |

Erik the Outgolfer · Accepted Answer · 2018-04-09 12:44:47Z

6

Jelly, 4 bytes

B‘ḅ3

Try it online!

answered Apr 9, 2018 at 12:44

Erik the Outgolfer

40.6k5 gold badges42 silver badges122 bronze badges

\$\begingroup\$ Binary, Increment, To-base, 3. That's really all that needs to be said. \$\endgroup\$
– Adám
Apr 9, 2018 at 14:01
2

\$\begingroup\$ @Adám Technically that's From-base, but yes, this is trivial in most, if not all, golfing languages. \$\endgroup\$
– Erik the Outgolfer
Apr 9, 2018 at 16:39

Add a comment |

DELETE_ME · Accepted Answer · 2018-04-09 14:01:11Z

6

J, 7 bytes

3#.1+#:

Try it online!

Thanks Galen Ivanov for -4 bytes! I really need to improve my J golfing skill...

edited Apr 9, 2018 at 14:01

answered Apr 9, 2018 at 12:48

DELETE_ME

17.3k2 gold badges36 silver badges70 bronze badges

1

\$\begingroup\$ 7 bytes: 3#.1+#: TIO \$\endgroup\$
– Galen Ivanov
Apr 9, 2018 at 12:56
\$\begingroup\$ Also thanks for the template, I need something to learn about : 0. \$\endgroup\$
– DELETE_ME
Apr 9, 2018 at 14:04
\$\begingroup\$ The template is not mine, I forgot who's its author. \$\endgroup\$
– Galen Ivanov
Apr 9, 2018 at 14:20
2

\$\begingroup\$ That would be me :) \$\endgroup\$
– Conor O'Brien
Apr 9, 2018 at 14:30

Add a comment |

Giuseppe · Accepted Answer · 2018-04-10 11:55:29Z

6

R, 55 43 bytes

function(n)(n%/%2^(x=0:log2(n))%%2+1)%*%3^x

Try it online!

Uses the standard base conversion trick in R, increments, and then uses a dot product with powers of 3 to convert back to an integer.

Thanks to @user2390246 for dropping 12 bytes!

edited Apr 10, 2018 at 11:55

answered Apr 9, 2018 at 13:10

Giuseppe

28.6k3 gold badges31 silver badges103 bronze badges

\$\begingroup\$ Because the conversion to binary is not the final output, the order of the digits doesn't matter. So instead of floor(log(n)):0 you can do 0:log(n) and save some bytes: 43 bytes \$\endgroup\$
– user2390246
Apr 10, 2018 at 9:25
\$\begingroup\$ @user2390246 of course, thank you. \$\endgroup\$
– Giuseppe
Apr 10, 2018 at 11:55

Add a comment |

Uriel · Accepted Answer · 2018-04-10 12:07:42Z

6

05AB1E, 5 bytes

b€>3β

Try it online!

b       binary
 €>     increment each
   3β   base 3

05AB1E, 5 bytes

2в>3β

Try it online!

edited Apr 10, 2018 at 12:07

answered Apr 9, 2018 at 12:48

Uriel

13.2k4 gold badges17 silver badges45 bronze badges

\$\begingroup\$ S works for € too. \$\endgroup\$
– Magic Octopus Urn
Apr 10, 2018 at 1:17

Add a comment |

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

Java 10, 81 52 bytes (Base conversion)

n->n.toString(n,2).chars().reduce(0,(r,c)->r*3+c-47)

Try it online.

-29 bytes thanks to @Holger.

Explanation:

n->{                         // Method with Long as both parameter and return-type
  n.toString(n,2)            //  Convert the input to a Base-2 String
  .chars().reduce(0,(r,c)->  //  Loop over its digits as bytes
    r*3+c-47)                //  Multiply the current result by 3, and add the digit + 1
                             //  (which is equal to increasing each digit by 1,
                             //  and then converting from Base-3 to Base-10)

Java 10, 171 167 151 150 149 bytes (Sequence)

n->{int t=31-n.numberOfLeadingZeros(n);return a(t+1)+b(n-(1<<t));};int a(int n){return--n<1?n+2:3*a(n)+1;}int b(int n){return n<1?0:n+3*b(n/=2)+n*2;}

-16 bytes thanks to @musicman523, changing (int)Math.pow(2,t) to (1<<t).
-1 byte thanks to @Holger, changing (int)(Math.log(n)/Math.log(2)) to 31-n.numberOfLeadingZeros(n).

Try it online.

Explanation:

n->{                         // Method with Integer as both parameter and return-type
  int t=31-n.numberOfLeadingZeros(n);
                             //  2_log(n)
  return a(t+1)              //  Return A060816(2_log(n)+1)
         +b(n-(1<<t));}      //   + A005836(n-2^2_log(n))

// A060816: a(n) = 3*a(n-1) + 1; a(0)=1, a(1)=2
int a(int n){return--n<1?n+2:3*a(n)+1;}

// A005836: a(n+1) = 3*a(floor(n/2)) + n - 2*floor(n/2).
int b(int n){return n<1?0:n+3*b(n/=2)+n*2;}

When we look at the sequence:

2,  7,8,  22,23,25,26,  67,68,70,71,76,77,79,80,  202,203,205,206,211,212,214,215,229,230,232,233,238,239,241,242, ...

We can see multiple subsequences:

A053645(n):
0,  0,1,  0,1,2,3,  0,1,2,3,4,5,6,7,  0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,  ...

A060816(A053645(n)):
2,  7,7,  22,22,22,22,  67,67,67,67,67,67,67,67,  202,202,202,202,202,202,202,202,202,202,202,202,202,202,202,  ...

A005836(A053645(n)+1)
0,  0,1,  0,1,3,4,  0,1,3,4,9,10,12,13,  0,1,3,4,9,10,12,13,27,28,30,31,36,37,39,40,  ...

So the sequence being asked is:

A060816(A053645(n)) + A005836(A053645(n)+1)

I suck at finding patterns, so I'm proud of what I found above.. Having said that, @user202729 found a better and shorter approach in Java within a few minutes.. :'(

Re n.toString(n,2).getBytes() ... I think manual conversion may be shorter. — DELETE_ME, Apr 9, 2018 at 12:50
I think in the sequence version you can change out (int)Math.pow(2,t) for 1<<t...and then inline that expression and drop the variable i (152 bytes) — musicman523, Apr 9, 2018 at 19:15
In real life, I’d use 31-Integer.numberOfLeadingZeros(n) instead of (int)(Math.log(n)/Math.log(2)), but it’s not shorter. Unless you use import static in the header, which might stretch the rules too far. — Holger, Apr 11, 2018 at 8:36
I just tried to convert your first variant’s loop to a stream solution, with success: n -> n.toString(n,2).chars().reduce(0,(r,c)->r*3+c-47) — Holger, Apr 11, 2018 at 8:49

Uriel · Accepted Answer · 2018-04-09 15:20:42Z

5

APL (Dyalog), 10 bytes

3⊥1+2⊥⍣¯1⊢

Try it online!

    2⊥⍣¯1  binary
  1+       go guess
3⊥         base 3

edited Apr 9, 2018 at 15:20

answered Apr 9, 2018 at 12:46

Uriel

13.2k4 gold badges17 silver badges45 bronze badges

Add a comment |

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

4

Brachylog, 7 bytes

ḃ+₁ᵐ~ḃ₃

Try it online!

Explanation

Not that you really need one, but…

ḃ            To binary
 +₁ᵐ         Map increment
    ~ḃ₃      From ternary

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 9, 2018 at 12:51

Fatalize

38.7k5 gold badges68 silver badges161 bronze badges

Add a comment |

Kirill L. · Accepted Answer · 2018-04-09 13:29:46Z

4

Ruby, 27 bytes

f=->x{x>0?x%2+1+3*f[x/2]:0}

Try it online!

edited Apr 9, 2018 at 13:29

answered Apr 9, 2018 at 13:24

Kirill L.

13.9k2 gold badges15 silver badges50 bronze badges

Add a comment |

TFeld · Accepted Answer · 2018-04-09 13:03:28Z

3

Python 2, 56 55 bytes

lambda n:int(''.join('12'[c>'0']for c in bin(n)[2:]),3)

Try it online!

answered Apr 9, 2018 at 13:03

TFeld

19.8k3 gold badges20 silver badges63 bronze badges

Add a comment |

Conor O'Brien · Accepted Answer · 2018-04-09 13:33:51Z

3

Attache, 19 bytes

FromBase&3@1&`+@Bin

Try it online!

This is a composition of three functions:

FromBase&3
1&`+
Bin

This first converts to binary (Bin), increments it (1&`+), then converts to ternary (FromBase&3).

Alternatives

Non-pointfree, 21 bytes: {FromBase[Bin!_+1,3]}

Without builtins, 57 bytes: Sum@{_*3^(#_-Iota!_-1)}@{If[_>0,$[_/2|Floor]'(1+_%2),[]]}

answered Apr 9, 2018 at 13:33

Conor O'Brien

40.1k3 gold badges90 silver badges178 bronze badges

Add a comment |

Neil · Accepted Answer · 2018-04-09 14:11:16Z

3

Retina 0.8.2, 36 bytes

.+
$*
+`^(1+)\1
$1;1
^
1
+`1;
;111
1

Try it online! Explanation:

.+
$*

Convert from decimal to unary.

+`^(1+)\1
$1;1

Repeatedly divmod by 2, and add 1 to the result of the modulo.

^
1

Add 1 to the first digit too.

+`1;
;111

Convert from unary-encoded base 3 to unary.

Convert to decimal.

answered Apr 9, 2018 at 14:11

Neil

170k12 gold badges72 silver badges275 bronze badges

Add a comment |

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

3

Japt, 6 bytes

¤cÄ n3
¤      // Convert the input to a base-2 string,
 c     // then map over it as charcodes.
  Ä    // For each item, add one to its charcode
       // and when that's done,
    n3 // parse the string as a base 3 number.

Takes input as a number, outputs a number.

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 9, 2018 at 14:29

Etheryte

3,8382 gold badges20 silver badges25 bronze badges

\$\begingroup\$ Damnit! Why didn't I think of that? Nicely done. \$\endgroup\$
– Shaggy
Apr 10, 2018 at 8:11

Add a comment |

Stewie Griffin · Accepted Answer · 2018-04-09 15:50:17Z

MATL, 12 7 6 bytes

BQ3_ZA

Try it online!

Saved 5 bytes thanks to Giuseppe and another one thanks to Luis Mendo.

Old 7 byte answer:

YBQc3ZA

Try it online!

Explanation:

YB        % Convert to binary string
  Q       % Increment each element
   c      % Convert ASCII values to characters
    3     % Push 3
     ZA   % Convert from base 3 to decimal.

Old one for 12 bytes:

BQtz:q3w^!Y*

Try it online!

Oh my, that was messy... So is this: `BQ3GBn:q^!Y*.

Explanation:

               % Implicit input
B              % Convert to binary vector
 Q             % Increment all numbers
  t            % Duplicate
   z           % Number of element in vector
    :          % Range from 1 to that number
     q         % Decrement to get the range from 0 instead of 1
      3        % Push 3
       w       % Swap order of stack
        ^      % Raise 3 to the power of 0, 1, ...
         !     % Transpose
          Y*   % Matrix multiplication
               % Implicit output

Hyarus · Accepted Answer · 2018-04-09 15:57:54Z

3

C# (Visual C# Compiler), 128 bytes

using System;using System.Linq;i=>{int z=0;return Convert.ToString(i,2).Reverse().Select(a=>(a-47)*(int)Math.Pow(3,z++)).Sum();}

Try it online!

I am counting System because i use Convert and Math.

answered Apr 9, 2018 at 15:57

Hyarus

2511 silver badge5 bronze badges

\$\begingroup\$ Select gives you the index as optional parameter. So you could get rid of your z variable. Also in the expression body you could get rid of the {, } and return statements. So something like this n=>Convert.ToString(n,2).Reverse().Select((x,i)=>(x-47)*Math.Pow(3,i)).Sum(); \$\endgroup\$
– NtFreX
Apr 11, 2018 at 9:38

Add a comment |

ElPedro · Accepted Answer · 2018-04-09 13:25:42Z

2

Python 2, 56 54 bytes

lambda i:int(''.join(`int(x)+1`for x in bin(i)[2:]),3)

Try it online!

edited Apr 9, 2018 at 13:25

answered Apr 9, 2018 at 13:02

ElPedro

6,3992 gold badges23 silver badges38 bronze badges

Add a comment |

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

2

C, 32 27 bytes

n(x){x=x?x%2+1+3*n(x/2):0;}

Based on user202729's Java answer. Try it online here. Thanks to Kevin Cruijssen for golfing 5 bytes.

Ungolfed version:

n(x) { // recursive function; both argument and return type are implicitly int
    x = // implicit return
    x ? x % 2 + 1 + 3*n(x/2) // if x != 0 return x % 2 + 1 + 3*n(x/2) (recursive call)
    : 0; // else return 0
}

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 9, 2018 at 13:38

O.O.Balance

1,6091 gold badge9 silver badges19 bronze badges

\$\begingroup\$ You can save 5 bytes by replacing the return with x= and reversing the ternary so the ! is no longer necessary: n(x){x=x?x%2+1+3*n(x/2):0;} \$\endgroup\$
– Kevin Cruijssen
Apr 9, 2018 at 13:52
\$\begingroup\$ @KevinCruijssen Nice. Thanks! \$\endgroup\$
– O.O.Balance
Apr 9, 2018 at 13:59

Add a comment |

Fyr · Accepted Answer · 2018-04-09 14:36:22Z

2

Husk, 5 bytes

B3m→ḋ

Try it online!

Explanation

B3m→ḋ
    ḋ  Convert to base 2
  m→   Map increment
B3     Convert from base 3

answered Apr 9, 2018 at 14:36

Fyr

6213 silver badges4 bronze badges

Add a comment |

Stewie Griffin · Accepted Answer · 2018-04-09 14:48:05Z

2

Octave with the communication toolbox, 33 32 bytes

@(x)(de2bi(x)+1)*3.^(0:log2(x))'

Try it online!

Converts the input to a binary vector using de2bi, and incrementing all numbers. Does matrix multiplication with a vertical vector of 3 raised to the appropriate powers: 1, 3, 9, ..., thus getting the sum without an explicit call to sum.

edited Apr 9, 2018 at 14:48

answered Apr 9, 2018 at 13:41

Stewie Griffin

46.3k13 gold badges130 silver badges295 bronze badges

\$\begingroup\$ While this is extremely clever, you can also do this for 32 bytes: Try it online! \$\endgroup\$
– Sanchises
Apr 11, 2018 at 9:54
\$\begingroup\$ And with MATLAB you may even do @(x)base2dec(de2bi(x)+49,3) for 27 (a rare occasion where MATLAB is more lenient than Octave) \$\endgroup\$
– Sanchises
Apr 11, 2018 at 9:55

Add a comment |

Francisco Hahn · Accepted Answer · 2018-04-09 14:54:55Z

2

PHP, 84 64 Bytes

Try it online!!

ORIGINAL Code

function f($n){$b=decbin($n);echo base_convert($b+str_repeat('1',strlen($b)),3,10);}

Try it online!!

Thanks to Cristoph, less bytes if ran with php -R

function f($n){echo base_convert(strtr(decbin($n),10,21),3,10);}

Explanation

function f($n){
$b=decbin($n);                    #Convert the iteger to base 2
echo base_convert(                  #base conversion PHP function
    $b+str_repeat('1',strlen($b)),  #It adds to our base 2 number
    3,                              #a number of the same digits length
    10);                            #with purely '1's
}

edited Apr 9, 2018 at 14:54

answered Apr 9, 2018 at 13:29

Francisco Hahn

6013 silver badges10 bronze badges

\$\begingroup\$ Here is when i see i have a loooogn way to go at programming....had no idea of the existence of strtr \$\endgroup\$
– Francisco Hahn
Apr 9, 2018 at 13:56
1

\$\begingroup\$ Will do!!, sorry <?="Will do!!" \$\endgroup\$
– Francisco Hahn
Apr 9, 2018 at 14:20

Add a comment |

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

2

CJam, 8 bytes

ri2b:)3b

Try it online!

Explanation

ri   e# Read input as an integer
2b   e# Convert to base 2. Gives a list containing 0 and 1
:)   e# Add 1 to each number in that list
3b   e# Convert list from base 3 to decimal. Implicitly display

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 9, 2018 at 15:26

Luis Mendo

104k9 gold badges133 silver badges370 bronze badges

\$\begingroup\$ I kinda like the :) .. \$\endgroup\$
– Ian H.
Apr 9, 2018 at 15:34

Add a comment |

anna328p · Accepted Answer · 2018-04-10 08:33:39Z

2

Ruby, 28 bytes

f=->x{x>0?x%2+3*f[x>>1]+1:0}

black magic, no idea how it works

Try it online!

answered Apr 10, 2018 at 8:33

anna328p

6,3762 gold badges31 silver badges63 bronze badges

\$\begingroup\$ the left shift gets binary digits right to left, and x%2+1 increases the binary value according to the spec. \$\endgroup\$
– qwr
Apr 10, 2018 at 19:34

Add a comment |

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

Whitespace, 117 bytes

[S S S N
_Push_0][S N
S _Duplicate_0][S N
S _Duplicate_0][T   N
T   T   _Read_STDIN_as_number][T    T   T   _Retrieve][N
S S S N
_Create_Label_OUTER_LOOP][S N
S _Duplicate][S S S T   S N
_Push_2][T  S T T   _Modulo][S S S T    N
_Push_1][T  S S S _Add][S N
T   _Swap][S S S T  S N
_Push_2][T  S T S _Integer_division][S N
S _Duplicate][N
T   S N
_If_0_jump_to_Label_INNER_LOOP][N
S N
S N
_Jump_to_Label_OUTER_LOOP][N
S S N
_Create_Label_INNER_LOOP][S S S T   T   N
_Push_3][T  S S N
_Multiply][T    S S S _Add][S N
T   _Swap][S N
S _Duplicate][N
T   S T N
_If_0_jump_to_Label_PRINT_AND_EXIT][S N
T   _Swap][N
S N
N
_Jump_to_Label_INNER_LOOP][N
S S T   N
_Create_Label_PRINT_AND_EXIT][S N
T   _Swap][T    N
S T _Output_integer_to_STDOUT]

Letters S (space), T (tab), and N (new-line) added as highlighting only.
[..._some_action] added as explanation only.

Try it online (with raw spaces, tabs and new-lines only).

Explanation in pseudo-code:

I first converted the recursive function int f(int n){return n<1?0:n%2+1+3*f(n/2);} to its iterative form (in pseudo-code):

Integer n = STDIN as integer
Add starting_value 0 to the stack
function OUTER_LOOP:
  while(true){
    Add n%2+1 to the stack
    n = n/2
    if(n == 0):
      Jump to INNER_LOOP
    Else:
      Jump to next iteration OUTER_LOOP

function INNER_LOOP:
  while(true){
    n = 3*n
    n = n + Value at the top of the stack (the ones we calculated with n%2+1)
    Swap top two items
    Check if the top is now 0 (starting value):
      Jump to PRINT_AND_EXIT
    Else:
      Swap top two items back
      Jump to next iteration INNER_LOOP

function PRINT_AND_EXIT:
  Swap top two items back
  Print top to STDOUT as integer
  Exit program with error: Exit not defined

And I then implemented this iterative approach in the stack-based language Whitespace, using it's default stack.

Example runs:

Input: 1

Command    Explanation                   Stack           Heap    STDIN   STDOUT   STDERR

SSSN       Push 0                        [0]
SNS        Duplicate top (0)             [0,0]
SNS        Duplicate top (0)             [0,0,0]
TNTT       Read STDIN as integer         [0,0]           {0:1}   1
TTT        Retrieve                      [0,1]           {0:1}
NSSSN      Create Label OUTER_LOOP       [0,1]           {0:1}
 SNS       Duplicate top (1)             [0,1,1]         {0:1}
 SSSTSN    Push 2                        [0,1,1,2]       {0:1}
 TSTT      Modulo top two (1%2)          [0,1,1]         {0:1}
 SSSTN     Push 1                        [0,1,1,1]       {0:1}
 TSSS      Add top two (1+1)             [0,1,2]         {0:1}
 SNT       Swap top two                  [0,2,1]         {0:1}
 SSSTSN    Push 2                        [0,2,1,2]       {0:1}
 TSTS      Int-divide top two (1/2)      [0,2,0]         {0:1}
 SNS       Duplicate top (0)             [0,2,0,0]       {0:1}
 NTSN      If 0: Go to Label INNER_LOOP  [0,2,0]         {0:1}
 NSSN      Create Label INNER_LOOP       [0,2,0]         {0:1}
  SSSTTN   Push 3                        [0,2,0,3]       {0:1}
  TSSN     Multiply top two (0*3)        [0,2,0]         {0:1}
  TSSS     Add top two (2+0)             [0,2]           {0:1}
  SNT      Swap top two                  [2,0]           {0:1}
  SNS      Duplicate top (0)             [2,0,0]         {0:1}
  NTSTN    If 0: Jump to Label PRINT     [2,0]           {0:1}
  NSSTN    Create Label PRINT            [2,0]           {0:1}
   SNT     Swap top two                  [0,2]           {0:1}
   TNST    Print top to STDOUT           [0]             {0:1}           2
                                                                                  error

Try it online (with raw spaces, tabs and new-lines only).
Stops with error: Exit not defined.

Input: 4

Command    Explanation                   Stack           Heap    STDIN   STDOUT   STDERR

SSSN       Push 0                        [0]
SNS        Duplicate top (0)             [0,0]
SNS        Duplicate top (0)             [0,0,0]
TNTT       Read STDIN as integer         [0,0]           {0:4}   4
TTT        Retrieve                      [0,4]           {0:4}
NSSSN      Create Label OUTER_LOOP       [0,4]           {0:4}
 SNS       Duplicate top (4)             [0,4,4]         {0:4}
 SSSTSN    Push 2                        [0,4,4,2]       {0:4}
 TSTT      Modulo top two (4%2)          [0,4,0]         {0:4}
 SSSTN     Push 1                        [0,4,0,1]       {0:4}
 TSSS      Add top two (0+1)             [0,4,1]         {0:4}
 SNT       Swap top two                  [0,1,4]         {0:4}
 SSSTSN    Push 2                        [0,1,4,2]       {0:4}
 TSTS      Int-divide top two (4/2)      [0,1,2]         {0:4}
 SNS       Duplicate top (2)             [0,1,2,2]       {0:4}
 NTSN      If 0: Go to Label INNER_LOOP  [0,1,2]         {0:4}
 NSNSN     Jump to Label OUTER_LOOP      [0,1,2]         {0:4}
 SNS       Duplicate top (2)             [0,1,2,2]       {0:4}
 SSSTSN    Push 2                        [0,1,2,2,2]     {0:4}
 TSTT      Modulo top two (2%2)          [0,1,2,0]       {0:4}
 SSSTN     Push 1                        [0,1,2,0,1]     {0:4}
 TSSS      Add top two (0+1)             [0,1,2,1]       {0:4}
 SNT       Swap top two                  [0,1,1,2]       {0:4}
 SSSTSN    Push 2                        [0,1,1,2,2]     {0:4}
 TSTS      Int-divide top two (2/2)      [0,1,1,1]       {0:4}
 SNS       Duplicate top (1)             [0,1,1,1,1]     {0:4}
 NTSN      If 0: Go to Label INNER_LOOP  [0,1,1,1]       {0:4}
 NSNSN     Jump to Label OUTER_LOOP      [0,1,1,1]       {0:4}
 SNS       Duplicate top (1)             [0,1,1,1,1]     {0:4}
 SSSTSN    Push 2                        [0,1,1,1,1,2]   {0:4}
 TSTT      Modulo top two (1%2)          [0,1,1,1,1]     {0:4}
 SSSTN     Push 1                        [0,1,1,1,1,1]   {0:4}
 TSSS      Add top two (1+1)             [0,1,1,1,2]     {0:4}
 SNT       Swap top two                  [0,1,1,2,1]     {0:4}
 SSSTSN    Push 2                        [0,1,1,2,1,2]   {0:4}
 TSTS      Int-divide top two (1/2)      [0,1,1,2,0]     {0:4}
 SNS       Duplicate top (0)             [0,1,1,2,0,0]   {0:4}
 NTSN      If 0: Go to Label INNER_LOOP  [0,1,1,2,0]     {0:4}
 NSSN      Create Label INNER_LOOP       [0,1,1,2,0]     {0:4}
  SSSTTN   Push 3                        [0,1,1,2,0,3]   {0:4}
  TSSN     Multiply top two (0*3)        [0,1,1,2,0]     {0:4}
  TSSS     Add top two (2+0)             [0,1,1,2]       {0:4}
  SNT      Swap top two                  [0,1,2,1]       {0:4}
  SNS      Duplicate top (1)             [0,1,2,1,1]     {0:4}
  NTSTN    If 0: Jump to Label PRINT     [0,1,2,1]       {0:4}
  SNT      Swap top two                  [0,1,1,2]       {0:4}
  NSNN     Jump to Label INNER_LOOP      [0,1,1,2]       {0:4}
  SSSTTN   Push 3                        [0,1,1,2,3]     {0:4}
  TSSN     Multiply top two (2*3)        [0,1,1,6]       {0:4}
  TSSS     Add top two (1+6)             [0,1,7]         {0:4}
  SNT      Swap top two                  [0,7,1]         {0:4}
  SNS      Duplicate top (1)             [0,7,1,1]       {0:4}
  NTSTN    If 0: Jump to Label PRINT     [0,7,1]         {0:4}
  SNT      Swap top two                  [0,1,7]         {0:4}
  NSNN     Jump to Label INNER_LOOP      [0,1,7]         {0:4}
  SSSTTN   Push 3                        [0,1,7,3]       {0:4}
  TSSN     Multiply top two (7*3)        [0,1,21]        {0:4}
  TSSS     Add top two (1+21)            [0,22]          {0:4}
  SNT      Swap top two                  [22,0]          {0:4}
  SNS      Duplicate top (0)             [22,0,0]        {0:4}
  NTSTN    If 0: Jump to Label PRINT     [22,0]          {0:4}
  NSSTN    Create Label PRINT            [22,0]          {0:4}
   SNT     Swap top two                  [0,22]          {0:4}
   TNST    Print top to STDOUT           [0]             {0:4}           22
                                                                                  error

Try it online (with raw spaces, tabs and new-lines only).
Stops with error: Exit not defined.

At this point, why not write assembly? Also I have a slightly simpler iterative method in my answer codegolf.stackexchange.com/a/161833/17360 — qwr, Apr 10, 2018 at 19:04
@qwr Your Python code is almost the same as the displayed Java code. Java is just more verbose and error-prone. The only difference is that my Java code is a nested while-loop, and yours is separated. I could do that as well in Java, but since it's nested in Whitespace I chose to write it as such in the Java pseudo-code as well. Also, Whitespace doesn't have any way to know the number of items left on the stack, which is why I push the 0 at the start, and in the INNER_LOOP part of the code do: swap, check if 0, swap back. Nice Assembly answer, though. So I've +1-ed it. :) — Kevin Cruijssen, Apr 10, 2018 at 20:30
I still think you can get rid of the n < 1 check by pushing values until n is 0 and then popping them until you hit your boundary value (0). The stack depth doesn't need to be stored explicitly and there shouldn't even need to be swapping (if you mean swapping the top two values like in lisp) — qwr, Apr 10, 2018 at 20:40
@qwr "I still think you can get rid of the n < 1 check by pushing values until n is 0" Umm.. checking if n < 1 (or n == 0) IS pushing values until n is 0.. Or am I misinterpreting something here.. :S "The stack depth doesn't need to be stored explicitly" In Java it does, otherwise I can't create the array. I could have used a java.util.Stack instead, but I just used an array to make it less verbose. In Whitespace the stack is of undefined size. — Kevin Cruijssen, Apr 11, 2018 at 6:42

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

2

Brain-Flak, 74 bytes

({<>(())<>({<({}[()])><>([{}]())<>})}(<>)){{}((({})()){}{}[{}])([][()])}{}

Try it online!

"Readable" version

({<>(())<>
  ({
    <({}[()])>
    <>
    ([{}]())
    <>
  })
}
# At this point we have a inverted binary string on the stack
(<>)
)
{
  {}
  (
    (({})()){}{}[{}]
  )
  ([][()])
}{}

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 9, 2018 at 20:22

MegaTom

4,2661 gold badge20 silver badges24 bronze badges

\$\begingroup\$ -2 bytes \$\endgroup\$
– Jo King ♦
Apr 10, 2018 at 0:00

Add a comment |

emanresu A · Accepted Answer · 2021-09-15 10:10:35Z

2

Vyxal, 4 bytes

b›3β

Try it Online!

b    # Binary
 ›   # Increment
  3β # From base 3

answered Sep 15, 2021 at 10:10

emanresu A

37.8k5 gold badges91 silver badges217 bronze badges

Add a comment |

caird coinheringaahin g · Accepted Answer · 2018-04-09 12:53:29Z

1

Add++, 14 bytes

L,BBu1€+B]3$Bb

Try it online!

answered Apr 9, 2018 at 12:53

caird coinheringaahin g♦

49.9k11 gold badges123 silver badges351 bronze badges

Add a comment |

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

1

Japt, 7 bytes

¤£°XÃn3

Try it here

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Apr 9, 2018 at 13:44

Shaggy

41.9k4 gold badges34 silver badges93 bronze badges

Add a comment |

Angs · Accepted Answer · 2018-04-09 14:24:20Z

1

Haskell, 32 bytes

f 0=0
f a=1+mod a 2+3*f(div a 2)

Try it online!

answered Apr 9, 2018 at 14:24

Angs

4,9872 gold badges15 silver badges36 bronze badges

Add a comment |

Up go the bits!

Input

Output

Rules

Test Cases

45 Answers 45

Python 2, 31 bytes

JavaScript (Node.js), 23 bytes

Java (JDK 10), 44 bytes

Jelly, 4 bytes

J, 7 bytes

R, 55 43 bytes

05AB1E, 5 bytes

05AB1E, 5 bytes

Java 10, 81 52 bytes (Base conversion)

Java 10, 171 167 151 150 149 bytes (Sequence)

APL (Dyalog), 10 bytes

Brachylog, 7 bytes

Explanation

Ruby, 27 bytes

Python 2, 56 55 bytes

Attache, 19 bytes

Alternatives

Retina 0.8.2, 36 bytes

Japt, 6 bytes

MATL, 12 7 6 bytes

Explanation:

Explanation:

C# (Visual C# Compiler), 128 bytes

Python 2, 56 54 bytes

C, 32 27 bytes

Husk, 5 bytes

Explanation

Octave with the communication toolbox, 33 32 bytes

PHP, 84 64 Bytes

CJam, 8 bytes

Explanation

Ruby, 28 bytes

Whitespace, 117 bytes

Explanation in pseudo-code:

Example runs:

Brain-Flak, 74 bytes

"Readable" version

Vyxal, 4 bytes

Add++, 14 bytes

Japt, 7 bytes

Haskell, 32 bytes

Your Answer

Sign up or log in

Post as a guest

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

Related

Hot Network Questions

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