title: Total Number Of Non Decreasing Numbers With N Digits 1
signature: totalNumberOfNonDecreasingNumbersWithNDigits1(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          40, 
          2054455634)
      }");
  
      print("TEST-1...${driver(
          11, 
          167960)
      }");
  
      print("TEST-2...${driver(
          94, 
          2509710226100)
      }");
  
      print("TEST-3...${driver(
          73, 
          293052087900)
      }");
  
      print("TEST-4...${driver(
          6, 
          5005)
      }");
  
      print("TEST-5...${driver(
          73, 
          293052087900)
      }");
  
      print("TEST-6...${driver(
          58, 
          42757703560)
      }");
  
      print("TEST-7...${driver(
          40, 
          2054455634)
      }");
  
      print("TEST-8...${driver(
          64, 
          97082021465)
      }");
  
      print("TEST-9...${driver(
          66, 
          125595622175)
      }");
  
      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;
  }