Problem Statement

Balanced ternary is a way of representing numbers. Unlike the prevailing binary representation, a balanced ternary integer is in base 3, and each digit can have the values 1, 0, or −1.

Decimal 11 = 32 + 31 − 30, thus it can be written as "++−" Decimal 6 = 32 − 31 + 0 × 30, thus it can be written as "+−0"

Implement balanced ternary representation of integers with the following:

Test case With balanced ternaries a from string "+-0++0+", b from native integer -436, c "+-++-":

Note: The pages generalised floating point addition and generalised floating point multiplication have code implementing arbitrary precision floating point balanced ternary.

Let's start with the solution:

BalancedTernary(n){
	k = 0
	if abs(n)<2
		return n=1?"+":n=0?"0":"-"
	if n<1
		negative := true, n:= -1*n
	while !break {
		d := Mod(n, 3**(k+1)) / 3**k
		d := d=2?-1:d
		n := n - (d * 3**k)
		r := (d=-1?"-":d=1?"+":0) . r
		k++
		if (n = 3**k)
			r := "+" . r	, break := true
	}
	if negative {
		StringReplace, r, r, -,n, all
		StringReplace, r, r, `+,-, all
		StringReplace, r, r, n,+, all
	}
	return r
}


data =
(
523
-436
65
-262023
)
loop, Parse, data, `n
	result .= A_LoopField " : " BalancedTernary(A_LoopField) "`n"
MsgBox % result
return