title: N Th Number Whose Sum Of Digits Is Ten 2
signature: int nThNumberWhoseSumOfDigitsIsTen2(int n) {
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(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), 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(68, 631); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(70, 649); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(69, 640); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(93, 856); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(99, 910); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(44, 415); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(91, 838); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(8, 82); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(83, 766); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(51, 478); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def n_th_number_whose_sum_of_digits_is_ten_2(n):
      nthElement = (19 + ((n - 1) * 9))
      outliersCount = (int(math.log10(nthElement)) - 1)
      nthElement += (9 * outliersCount)
      return nthElement
source_cpp: int n_th_number_whose_sum_of_digits_is_ten_2(int n) {
    int nthElement = 19 + ( n - 1 ) * 9;
    int outliersCount = ( int ) log10 ( nthElement ) - 1;
    nthElement += 9 * outliersCount;
    return nthElement;
  }