title: Count Number Pairs N B N Gcd B B
signature: function countNumberPairsNBNGcdBB(n: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return Math.abs(actual - expected) < 1e-09;
  }
  
  function driver(n: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(17, 58.47239288489289);
    console.log(`TEST-0...${result}`);
  
    result = driver(72, 349.9783310569835);
    console.log(`TEST-1...${result}`);
  
    result = driver(43, 187.0499406858786);
    console.log(`TEST-2...${result}`);
  
    result = driver(55, 252.6486716559348);
    console.log(`TEST-3...${result}`);
  
    result = driver(62, 291.1683590456309);
    console.log(`TEST-4...${result}`);
  
    result = driver(22, 81.19789150478006);
    console.log(`TEST-5...${result}`);
  
    result = driver(17, 58.47239288489289);
    console.log(`TEST-6...${result}`);
  
    result = driver(68, 326.67596370158344);
    console.log(`TEST-7...${result}`);
  
    result = driver(20, 71.95479314287363);
    console.log(`TEST-8...${result}`);
  
    result = driver(29, 114.88796013002468);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
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;
  }