title: Check Two Given Circles Touch Intersect
signature: pub fn check_two_given_circles_touch_intersect(x1: i32, y1: i32, x2: i32, y2: i32, r1: i32, r2: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(x1: i32, y1: i32, x2: i32, y2: i32, r1: i32, r2: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(x1, y1, x2, y2, r1, r2), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        11, 36, 62, 64, 50, 4, 
        -1
      ));
      
      println!("TEST-1...{}", driver(
        87, 1, 62, 64, 54, 41, 
        0
      ));
      
      println!("TEST-2...{}", driver(
        51, 1, 47, 90, 14, 71, 
        -1
      ));
      
      println!("TEST-3...{}", driver(
        89, 67, 9, 52, 94, 21, 
        0
      ));
      
      println!("TEST-4...{}", driver(
        64, 10, 79, 45, 67, 78, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        57, 86, 99, 43, 83, 63, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        65, 90, 42, 82, 77, 32, 
        0
      ));
      
      println!("TEST-7...{}", driver(
        32, 23, 28, 26, 60, 45, 
        0
      ));
      
      println!("TEST-8...{}", driver(
        73, 61, 63, 77, 92, 76, 
        0
      ));
      
      println!("TEST-9...{}", driver(
        3, 99, 6, 19, 21, 28, 
        -1
      ));
      
  }
source_py: def check_two_given_circles_touch_intersect(x1, y1, x2, y2, r1, r2):
      distSq = (((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)))
      radSumSq = ((r1 + r2) * (r1 + r2))
      if (distSq == radSumSq):
          return 1
      elif (distSq > radSumSq):
          return (- 1)
      else:
          return 0
source_cpp: int check_two_given_circles_touch_intersect(int x1, int y1, int x2, int y2, int r1, int r2) {
    int distSq = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
    int radSumSq = ( r1 + r2 ) * ( r1 + r2 );
    if ( distSq == radSumSq ) return 1;
    else if ( distSq > radSumSq ) return - 1;
    else return 0;
  }