title: Total Number Of Non Decreasing Numbers With N Digits 1
signature: pub fn total_number_of_non_decreasing_numbers_with_n_digits_1(n: i32) -> i64 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i64, expected: i64)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i64)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        40, 
        2054455634
      ));
      
      println!("TEST-1...{}", driver(
        11, 
        167960
      ));
      
      println!("TEST-2...{}", driver(
        94, 
        2509710226100
      ));
      
      println!("TEST-3...{}", driver(
        73, 
        293052087900
      ));
      
      println!("TEST-4...{}", driver(
        6, 
        5005
      ));
      
      println!("TEST-5...{}", driver(
        73, 
        293052087900
      ));
      
      println!("TEST-6...{}", driver(
        58, 
        42757703560
      ));
      
      println!("TEST-7...{}", driver(
        40, 
        2054455634
      ));
      
      println!("TEST-8...{}", driver(
        64, 
        97082021465
      ));
      
      println!("TEST-9...{}", 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;
  }