title: Number Unique Rectangles Formed Using N Unit Squares
signature: def number_unique_rectangles_formed_using_n_unit_squares(n):
test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(34, 66)
      print(f"TEST-0...{result}")
  
      result = driver(49, 104)
      print(f"TEST-1...{result}")
  
      result = driver(41, 83)
      print(f"TEST-2...{result}")
  
      result = driver(17, 28)
      print(f"TEST-3...{result}")
  
      result = driver(67, 151)
      print(f"TEST-4...{result}")
  
      result = driver(38, 76)
      print(f"TEST-5...{result}")
  
      result = driver(59, 128)
      print(f"TEST-6...{result}")
  
      result = driver(64, 144)
      print(f"TEST-7...{result}")
  
      result = driver(61, 135)
      print(f"TEST-8...{result}")
  
      result = driver(58, 127)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
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;
  }