title: Total Number Of Non Decreasing Numbers With N Digits 1
signature: totalNumberOfNonDecreasingNumbersWithNDigits1 :: Integer -> Integer
  totalNumberOfNonDecreasingNumbersWithNDigits1 n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (40) (2054455634) )
  
      printf "TEST-1...%s\n" (driver (11) (167960) )
  
      printf "TEST-2...%s\n" (driver (94) (2509710226100) )
  
      printf "TEST-3...%s\n" (driver (73) (293052087900) )
  
      printf "TEST-4...%s\n" (driver (6) (5005) )
  
      printf "TEST-5...%s\n" (driver (73) (293052087900) )
  
      printf "TEST-6...%s\n" (driver (58) (42757703560) )
  
      printf "TEST-7...%s\n" (driver (40) (2054455634) )
  
      printf "TEST-8...%s\n" (driver (64) (97082021465) )
  
      printf "TEST-9...%s\n" (driver (66) (125595622175) )
  
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;
  }