title: Number Is Divisible By 29 Or Not
signature: pub fn number_is_divisible_by_29_or_not(n: i64) -> bool {
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: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(n: i64, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        29, 
        true
      ));
      
      println!("TEST-1...{}", driver(
        0, 
        true
      ));
      
      println!("TEST-2...{}", driver(
        65, 
        false
      ));
      
      println!("TEST-3...{}", driver(
        1419, 
        false
      ));
      
      println!("TEST-4...{}", driver(
        54, 
        false
      ));
      
      println!("TEST-5...{}", driver(
        7, 
        false
      ));
      
      println!("TEST-6...{}", driver(
        44, 
        false
      ));
      
      println!("TEST-7...{}", driver(
        34, 
        false
      ));
      
      println!("TEST-8...{}", driver(
        1160, 
        true
      ));
      
      println!("TEST-9...{}", driver(
        292929002929, 
        true
      ));
      
  }
source_py: def number_is_divisible_by_29_or_not(n):
      while int((n / 100)):
          last_digit = int((n % 10))
          n = int((n / 10))
          n += (last_digit * 3)
      return ((n % 29) == 0)
source_cpp: bool number_is_divisible_by_29_or_not(long long int n) {
    while ( n / 100 ) {
      int last_digit = n % 10;
      n /= 10;
      n += last_digit * 3;
    }
    return ( n % 29 == 0 );
  }