title: Write You Own Power Without Using Multiplication And Division
signature: function write_you_own_power_without_using_multiplication_and_division(a, b)
test_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(a, b, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(a, b) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver(66, 4, 18974736)
      print(string.format("TEST-0...%s",result))
  
  end
  
  main()
source_py: def write_you_own_power_without_using_multiplication_and_division(a, b):
      if (b == 0):
          return 1
      answer = a
      increment = a
      for i in range(1, b):
          for j in range(1, a):
              answer += increment
          increment = answer
      return answer
source_cpp: int write_you_own_power_without_using_multiplication_and_division(int a, int b) {
    if ( b == 0 ) return 1;
    int answer = a;
    int increment = a;
    int i, j;
    for ( i = 1;
    i < b;
    i ++ ) {
      for ( j = 1;
      j < a;
      j ++ ) {
        answer += increment;
      }
      increment = answer;
    }
    return answer;
  }