title: Number Unique Rectangles Formed Using N Unit Squares
signature: pub fn number_unique_rectangles_formed_using_n_unit_squares(n: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        34, 
        66
      ));
      
      println!("TEST-1...{}", driver(
        49, 
        104
      ));
      
      println!("TEST-2...{}", driver(
        41, 
        83
      ));
      
      println!("TEST-3...{}", driver(
        17, 
        28
      ));
      
      println!("TEST-4...{}", driver(
        67, 
        151
      ));
      
      println!("TEST-5...{}", driver(
        38, 
        76
      ));
      
      println!("TEST-6...{}", driver(
        59, 
        128
      ));
      
      println!("TEST-7...{}", driver(
        64, 
        144
      ));
      
      println!("TEST-8...{}", driver(
        61, 
        135
      ));
      
      println!("TEST-9...{}", driver(
        58, 
        127
      ));
      
  }
source_py: def number_unique_rectangles_formed_using_n_unit_squares(n):
      ans = 0
      for length in range(1, (int(math.sqrt(n)) + 1)):
          height = length
          while ((height * length) <= n):
              ans += 1
              height += 1
      return ans
source_cpp: int number_unique_rectangles_formed_using_n_unit_squares(int n) {
    int ans = 0;
    for ( int length = 1;
    length <= sqrt ( n );
    ++ length ) for ( int height = length;
    height * length <= n;
    ++ height ) ans ++;
    return ans;
  }