SCALE - Funny scales

Problem Link
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
using namespace std;

const int N = 1e4;
int rhs[N];
int lhs[N];


int convertToTernary(long long x, int arr[], int index)
{
  if(x == 0)
  return index;
  int remainder = x % 3;
  arr[index] = remainder;
  x = x / 3;

  return convertToTernary(x, arr, index + 1);
}

long convertToDecimal(int arr[], int len)
{
long result = 0;
long power = 1;
int i = 0;
while(i < len)
{
result += arr[i] * power;
power *= 3;
i++;
}

return result;

}

void solve(int arr[],  int len, long maxSum)
{
int i = 0;
int carry = 0;
int rlen = 0;
while(i < len)
{
arr[i] += carry;
carry = arr[i] / 3;
arr[i] = arr[i] % 3;

if(arr[i] == 0 || arr[i] == 1)
{
lhs[i] = 0;
}
else
{
lhs[i] = 1;
carry = 1;
}

rhs[i] = (arr[i] + lhs[i]) % 3;
i++;
}

rlen = len;
if(carry)
{
rhs[i] = carry;
rlen++;
}

long r = convertToDecimal(rhs, rlen);

// there is a chance of overflow in rhs, so we must check
//if it is greater than maxSum or not.
if(r > maxSum)
{
cout << "-1" << endl;
return;
}

for(int i = 0; i < len; i++)
{
if(lhs[i])
{
cout << i + 1 << " ";
}
}

cout << endl;

for(int i = 0; i < rlen; i++)
{
if(rhs[i])
{
cout << i + 1 << " ";
}
}

cout << endl;

}

int main()
{

int n;
long long x;

cin >> n >> x;

int arr[N];
memset(arr, 0, sizeof arr);
memset(lhs, 0, sizeof lhs);
memset(rhs, 0, sizeof rhs);

if(x == 0 || x == 1){
cout << "1" << endl;
return 0;
}

// calculate gp series of 1, 3, 9, 27, ...
//formula = (a(r^n - 1)) / (r - 1)
// a = 1, r = 3
long maxSum = ((pow(3, n) - 1)) / 2;
if(x > maxSum)
{
cout << "-1" << endl;
return 0;
}
int len = convertToTernary(x, arr, 0);

solve(arr, len, maxSum);
return 0;
}