title: Count Distinct Non Negative Pairs X Y Satisfy Inequality Xx Yy N 2
signature: def countDistinctNonNegativePairsXYSatisfyInequalityXxYyN2(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): 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(
        61, 
        54    
      )}")   
  
  
      println(s"TEST-1...${driver(
        45, 
        41    
      )}")   
  
  
      println(s"TEST-2...${driver(
        53, 
        50    
      )}")   
  
  
      println(s"TEST-3...${driver(
        4, 
        4    
      )}")   
  
  
      println(s"TEST-4...${driver(
        82, 
        73    
      )}")   
  
  
      println(s"TEST-5...${driver(
        86, 
        79    
      )}")   
  
  
      println(s"TEST-6...${driver(
        37, 
        35    
      )}")   
  
  
      println(s"TEST-7...${driver(
        48, 
        43    
      )}")   
  
  
      println(s"TEST-8...${driver(
        81, 
        71    
      )}")   
  
  
      println(s"TEST-9...${driver(
        50, 
        45    
      )}")   
  
  }
  
source_py: def count_distinct_non_negative_pairs_x_y_satisfy_inequality_xx_yy_n_2(n):
      res = 0
      x = 0
      while ((x * x) < n):
          y = 0
          while (((x * x) + (y * y)) < n):
              res = (res + 1)
              y = (y + 1)
          x = (x + 1)
      return res
source_cpp: int count_distinct_non_negative_pairs_x_y_satisfy_inequality_xx_yy_n_2(int n) {
    int res = 0;
    for ( int x = 0;
    x * x < n;
    x ++ ) for ( int y = 0;
    x * x + y * y < n;
    y ++ ) res ++;
    return res;
  }