title: Check Number Power K Using Base Changing Method
signature: bool checkNumberPowerKUsingBaseChangingMethod(int n, int k) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual == expected;
  }
  
  string driver(int n, int k, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, k), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(64, 4, true); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(16, 2, true); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(27, 3, true); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 72, false); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(1, 9, true); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(69, 17, false); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(8, 20, false); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(31, 79, false); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(43, 81, false); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(54, 89, false); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def check_number_power_k_using_base_changing_method(n, k):
      oneSeen = False
      while (n > 0):
          digit = (n % k)
          if (digit > 1):
              return False
          if (digit == 1):
              if oneSeen:
                  return False
              oneSeen = True
          n //= k
      return True
source_cpp: bool check_number_power_k_using_base_changing_method(unsigned int n, unsigned int k) {
    bool oneSeen = false;
    while ( n > 0 ) {
      int digit = n % k;
      if ( digit > 1 ) return false;
      if ( digit == 1 ) {
        if ( oneSeen ) return false;
        oneSeen = true;
      }
      n /= k;
    }
    return true;
  }