title: Total Number Of Non Decreasing Numbers With N Digits 1
signature: long long totalNumberOfNonDecreasingNumbersWithNDigits1(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(long long actual, long long expected){
      return actual == expected;
  }
  
  string driver(int n, long long 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(40, 2054455634); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(11, 167960); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(94, 2509710226100); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(73, 293052087900); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(6, 5005); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(73, 293052087900); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(58, 42757703560); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(40, 2054455634); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(64, 97082021465); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(66, 125595622175); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def total_number_of_non_decreasing_numbers_with_n_digits_1(n):
      N = 10
      count = 1
      for i in range(1, (n + 1)):
          count = int((count * ((N + i) - 1)))
          count = int((count / i))
      return count
source_cpp: long long int total_number_of_non_decreasing_numbers_with_n_digits_1(int n) {
    int N = 10;
    long long count = 1;
    for ( int i = 1;
    i <= n;
    i ++ ) {
      count *= ( N + i - 1 );
      count /= i;
    }
    return count;
  }