title: Check Large Number Divisible 13 Not
signature: check_large_number_divisible_13_not <- function(num) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(num, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(num), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          "vzTUaItpCpLnjY", 
          FALSE
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          "33855", 
          TRUE
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          "0011110101011", 
          TRUE
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          "MMQ", 
          FALSE
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          "439340517954", 
          TRUE
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          "000000000", 
          TRUE
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          "UugAuRRJbjEgl", 
          TRUE
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          "6406553695441", 
          TRUE
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          "011001", 
          TRUE
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          "yjFqEEvgiNjEX", 
          TRUE
      )))
  
  }
  
  main()
source_py: def check_large_number_divisible_13_not(num):
      length = len(num)
      if ((length == 1) and (num[0] == '0')):
          return True
      if ((length % 3) == 1):
          num = (str(num) + '00')
          length += 2
      elif ((length % 3) == 2):
          num = (str(num) + '0')
          length += 1
      sum = 0
      p = 1
      for i in range((length - 1), (- 1), (- 1)):
          group = 0
          group += (ord(num[i]) - ord('0'))
          i -= 1
          group += ((ord(num[i]) - ord('0')) * 10)
          i -= 1
          group += ((ord(num[i]) - ord('0')) * 100)
          sum = (sum + (group * p))
          p *= (- 1)
      sum = abs(sum)
      return ((sum % 13) == 0)
source_cpp: bool check_large_number_divisible_13_not(string num) {
    int length = num . size ( );
    if ( length == 1 && num [ 0 ] == '0' ) return true;
    if ( length % 3 == 1 ) {
      num += "00";
      length += 2;
    }
    else if ( length % 3 == 2 ) {
      num += "0";
      length += 1;
    }
    int sum = 0, p = 1;
    for ( int i = length - 1;
    i >= 0;
    i -- ) {
      int group = 0;
      group += num [ i -- ] - '0';
      group += ( num [ i -- ] - '0' ) * 10;
      group += ( num [ i ] - '0' ) * 100;
      sum = sum + group * p;
      p *= ( - 1 );
    }
    sum = abs ( sum );
    return ( sum % 13 == 0 );
  }