title: Number Is Divisible By 29 Or Not
signature: def number_is_divisible_by_29_or_not(n):
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 );
  }
question_info.test_code: import array
  import bisect
  import collections
  import datetime
  import functools
  import heapq
  import itertools
  import math
  import queue
  import re
  import string
  import sys
  from typing import Any, Dict, List, Optional, Set
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  def validate_solution(actual, expected):
      return actual == expected
  
  def driver(n, expected):
      try:
          if validate_solution(PLACEHOLDER_FN_NAME(
              n),
              expected
          ):
              return "PASSED"
          return "FAILED"
      except Exception as exception_obj:
          return type(exception_obj).__name__
      
  if __name__ == "__main__":
      result = driver(29, True)
      print(f"TEST-0...{result}")
  
      result = driver(0, True)
      print(f"TEST-1...{result}")
  
      result = driver(65, False)
      print(f"TEST-2...{result}")
  
      result = driver(1419, False)
      print(f"TEST-3...{result}")
  
      result = driver(54, False)
      print(f"TEST-4...{result}")
  
      result = driver(7, False)
      print(f"TEST-5...{result}")
  
      result = driver(44, False)
      print(f"TEST-6...{result}")
  
      result = driver(34, False)
      print(f"TEST-7...{result}")
  
      result = driver(1160, True)
      print(f"TEST-8...{result}")
  
      result = driver(292929002929, True)
      print(f"TEST-9...{result}")
  
      sys.exit(0)
question_info.test_case_ids: ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']
question_info.entry_fn_name: number_is_divisible_by_29_or_not
question_info.test_list: [{"idx": 0, "outputs": true, "inputs": {"n": 29}}, {"idx": 1, "outputs": true, "inputs": {"n": 0}}, {"idx": 2, "outputs": false, "inputs": {"n": 65}}, {"idx": 3, "outputs": false, "inputs": {"n": 1419}}, {"idx": 4, "outputs": false, "inputs": {"n": 54}}, {"idx": 5, "outputs": false, "inputs": {"n": 7}}, {"idx": 6, "outputs": false, "inputs": {"n": 44}}, {"idx": 7, "outputs": false, "inputs": {"n": 34}}, {"idx": 8, "outputs": true, "inputs": {"n": 1160}}, {"idx": 9, "outputs": true, "inputs": {"n": 292929002929}}]
question_info.entry_cls_name: Solution