title: Find Sum Even Factors Number
signature: pub fn find_sum_even_factors_number(n: 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(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        71, 
        0
      ));
      
      println!("TEST-1...{}", driver(
        78, 
        112
      ));
      
      println!("TEST-2...{}", driver(
        39, 
        0
      ));
      
      println!("TEST-3...{}", driver(
        36, 
        78
      ));
      
      println!("TEST-4...{}", driver(
        49, 
        0
      ));
      
      println!("TEST-5...{}", driver(
        17, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        53, 
        0
      ));
      
      println!("TEST-7...{}", driver(
        66, 
        96
      ));
      
      println!("TEST-8...{}", driver(
        92, 
        144
      ));
      
      println!("TEST-9...{}", driver(
        71, 
        0
      ));
      
  }
source_py: def find_sum_even_factors_number(n):
      if ((n % 2) != 0):
          return 0
      res = 1
      for i in range(2, (int(math.sqrt(n)) + 1)):
          count = 0
          curr_sum = 1
          curr_term = 1
          while ((n % i) == 0):
              count = (count + 1)
              n = (n // i)
              if ((i == 2) and (count == 1)):
                  curr_sum = 0
              curr_term = (curr_term * i)
              curr_sum = (curr_sum + curr_term)
          res = (res * curr_sum)
      if (n >= 2):
          res = (res * (1 + n))
      return res
source_cpp: int find_sum_even_factors_number(int n) {
    if ( n % 2 != 0 ) return 0;
    int res = 1;
    for ( int i = 2;
    i <= sqrt ( n );
    i ++ ) {
      int count = 0, curr_sum = 1, curr_term = 1;
      while ( n % i == 0 ) {
        count ++;
        n = n / i;
        if ( i == 2 && count == 1 ) curr_sum = 0;
        curr_term *= i;
        curr_sum += curr_term;
      }
      res *= curr_sum;
    }
    if ( n >= 2 ) res *= ( 1 + n );
    return res;
  }