title: Total Number Of Non Decreasing Numbers With N Digits 1
signature: function total_number_of_non_decreasing_numbers_with_n_digits_1(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(40, 2054455634);
      @printf("TEST-0...%s\n",result);
      
      result = driver(11, 167960);
      @printf("TEST-1...%s\n",result);
      
      result = driver(94, 2509710226100);
      @printf("TEST-2...%s\n",result);
      
      result = driver(73, 293052087900);
      @printf("TEST-3...%s\n",result);
      
      result = driver(6, 5005);
      @printf("TEST-4...%s\n",result);
      
      result = driver(73, 293052087900);
      @printf("TEST-5...%s\n",result);
      
      result = driver(58, 42757703560);
      @printf("TEST-6...%s\n",result);
      
      result = driver(40, 2054455634);
      @printf("TEST-7...%s\n",result);
      
      result = driver(64, 97082021465);
      @printf("TEST-8...%s\n",result);
      
      result = driver(66, 125595622175);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }