🚀 go-pugleaf

#include <stdio.h>
#include <fcntl.h>
#include <string.h>
#include <ctype.h>

static int t[33] = {
    4, 3, 2, 7, 6, 5, 4, 3, 2, 7,
    6, 5, 4, 3, 2, 7, 6, 5, 4, 3,
    2, 7, 6, 5, 4, 3, 2, 7, 6, 5,
    4 , 3, 2
};

static int m[10][10] = {
  { 0, 9, 4, 6, 8, 2, 7, 1, 3, 5 },
  { 9, 4, 6, 8, 2, 7, 1, 3, 5, 0 },
  { 4, 6, 8, 2, 7, 1, 3, 5, 0, 9 },
  { 6, 8, 2, 7, 1, 3, 5, 0, 9, 4 },
  { 8, 2, 7, 1, 3, 5, 0, 9, 4, 6 },
  { 2, 7, 1, 3, 5, 0, 9, 4, 6, 8 },
  { 7, 1, 3, 5, 0, 9, 4, 6, 8, 2 },
  { 1, 3, 5, 0, 9, 4, 6, 8, 2, 7 },
  { 3, 5, 0, 9, 4, 6, 8, 2, 7, 1 },
  { 5, 0, 9, 4, 6, 8, 2, 7, 1, 3 }
};

int mod10(s)
char *s;
{
  char c, *p;
  int u = 0;
  p = s;
  while (isdigit(*p))
      u = m[u][*p++ - '0'];
  return(b[u]);
}

  int mod11(s)
char *s;
{
  char c, *p;
  int r = 0;
  int i = 0;

  p = s;
  while (isdigit(*p)) {
    r += (t[i++] * (*p++- '0'));
  }
  r = 11 - (r % 11);

  if ( r == 11)
      r = 0;

  return r;
}