title: Count Number Pairs N B N Gcd B B
signature: def countNumberPairsNBNGcdBB(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Double , expected: Double): Boolean = {
      (actual - expected).abs < 1e-09
  }
  
  def driver(n: Int, expected: Double): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        17, 
        58.47239288489289    
      )}")   
  
  
      println(s"TEST-1...${driver(
        72, 
        349.9783310569835    
      )}")   
  
  
      println(s"TEST-2...${driver(
        43, 
        187.0499406858786    
      )}")   
  
  
      println(s"TEST-3...${driver(
        55, 
        252.6486716559348    
      )}")   
  
  
      println(s"TEST-4...${driver(
        62, 
        291.1683590456309    
      )}")   
  
  
      println(s"TEST-5...${driver(
        22, 
        81.19789150478006    
      )}")   
  
  
      println(s"TEST-6...${driver(
        17, 
        58.47239288489289    
      )}")   
  
  
      println(s"TEST-7...${driver(
        68, 
        326.67596370158344    
      )}")   
  
  
      println(s"TEST-8...${driver(
        20, 
        71.95479314287363    
      )}")   
  
  
      println(s"TEST-9...${driver(
        29, 
        114.88796013002468    
      )}")   
  
  }
  
source_py: def count_number_pairs_n_b_n_gcd_b_b(n):
      k = n
      imin = 1
      ans = 0
      while (imin <= n):
          imax = (n / k)
          ans += (k * ((imax - imin) + 1))
          imin = (imax + 1)
          k = (n / imin)
      return ans
source_cpp: int count_number_pairs_n_b_n_gcd_b_b(int n) {
    int k = n;
    int imin = 1;
    int ans = 0;
    while ( imin <= n ) {
      int imax = n / k;
      ans += k * ( imax - imin + 1 );
      imin = imax + 1;
      k = n / imin;
    }
    return ans;
  }