title: Count Distinct Non Negative Pairs X Y Satisfy Inequality Xx Yy N 2 1
signature: func countDistinctNonNegativePairsXYSatisfyInequalityXxYyN21(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(72, 64)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(75, 69)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(92, 83)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(30, 30)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(45, 41)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(40, 37)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(81, 71)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(17, 17)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(81, 71)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(99, 86)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }