title: Total Number Of Non Decreasing Numbers With N Digits 1
signature: total_number_of_non_decreasing_numbers_with_n_digits_1 <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          40L, 
          2054455634L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          11L, 
          167960L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          94L, 
          2509710226100L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          73L, 
          293052087900L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          6L, 
          5005L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          73L, 
          293052087900L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          58L, 
          42757703560L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          40L, 
          2054455634L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          64L, 
          97082021465L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          66L, 
          125595622175L
      )))
  
  }
  
  main()
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;
  }