title: Count Distinct Non Negative Pairs X Y Satisfy Inequality Xx Yy N 2 1
signature: countDistinctNonNegativePairsXYSatisfyInequalityXxYyN21(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          72, 
          64)
      }");
  
      print("TEST-1...${driver(
          75, 
          69)
      }");
  
      print("TEST-2...${driver(
          92, 
          83)
      }");
  
      print("TEST-3...${driver(
          30, 
          30)
      }");
  
      print("TEST-4...${driver(
          45, 
          41)
      }");
  
      print("TEST-5...${driver(
          40, 
          37)
      }");
  
      print("TEST-6...${driver(
          81, 
          71)
      }");
  
      print("TEST-7...${driver(
          17, 
          17)
      }");
  
      print("TEST-8...${driver(
          81, 
          71)
      }");
  
      print("TEST-9...${driver(
          99, 
          86)
      }");
  
      return 0;
  }
source_py: def count_distinct_non_negative_pairs_x_y_satisfy_inequality_xx_yy_n_2_1(n):
      x = 0
      res = 0
      yCount = 0
      while ((yCount * yCount) < n):
          yCount = (yCount + 1)
      while (yCount != 0):
          res = (res + yCount)
          x = (x + 1)
          while ((yCount != 0) and (((x * x) + ((yCount - 1) * (yCount - 1))) >= n)):
              yCount = (yCount - 1)
      return res
source_cpp: int count_distinct_non_negative_pairs_x_y_satisfy_inequality_xx_yy_n_2_1(int n) {
    int x = 0, yCount, res = 0;
    for ( yCount = 0;
    yCount * yCount < n;
    yCount ++ );
    while ( yCount != 0 ) {
      res += yCount;
      x ++;
      while ( yCount != 0 && ( x * x + ( yCount - 1 ) * ( yCount - 1 ) >= n ) ) yCount --;
    }
    return res;
  }