title: Number Is Divisible By 29 Or Not
signature: def numberIsDivisibleBy29OrNot(n: Long) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Boolean , expected: Boolean): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Long, expected: Boolean): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        29L, 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        0L, 
        true    
      )}")   
  
  
      println(s"TEST-2...${driver(
        65L, 
        false    
      )}")   
  
  
      println(s"TEST-3...${driver(
        1419L, 
        false    
      )}")   
  
  
      println(s"TEST-4...${driver(
        54L, 
        false    
      )}")   
  
  
      println(s"TEST-5...${driver(
        7L, 
        false    
      )}")   
  
  
      println(s"TEST-6...${driver(
        44L, 
        false    
      )}")   
  
  
      println(s"TEST-7...${driver(
        34L, 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        1160L, 
        true    
      )}")   
  
  
      println(s"TEST-9...${driver(
        292929002929L, 
        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 );
  }