title: Check Large Number Divisible 13 Not
signature: func checkLargeNumberDivisible13Not(num string) bool {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual bool, expected bool) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(num string, expected bool) string {
      if validateSolution(PLACEHOLDER_FN_NAME(num),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver("vzTUaItpCpLnjY", false)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver("33855", true)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver("0011110101011", true)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver("MMQ", false)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver("439340517954", true)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver("000000000", true)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver("UugAuRRJbjEgl", true)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver("6406553695441", true)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver("011001", true)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver("yjFqEEvgiNjEX", true)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 );
  }