title: Count Distinct Non Negative Pairs X Y Satisfy Inequality Xx Yy N 2 1
signature: int countDistinctNonNegativePairsXYSatisfyInequalityXxYyN21(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(72, 64); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(75, 69); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(92, 83); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(30, 30); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(45, 41); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(40, 37); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 71); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(17, 17); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 71); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(99, 86); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      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;
  }