enterprise dubs checker

#!/bin/bash
# fuck you faggot
echo "enter 0-9, faggot"
echo "this shit will check for dubs"
echo -n "digit 1:"
read digit1
echo -n "digit 2:"
read digit2
if test "$digit1" = "$digit2"
then
   echo "nice dubs bro"
else
   echo "sorry bro, not dubs"
fi
echo "back to /b/, please"

> #!/bin/bash

IHBT

>>2
YHNBT
NIJMUA

>>3

YTMND

>>4
BTBP

>>1'
>his code can't check for dubs in other bases

>>5

/PCK/

BTIBP, ``F''

>>6
technically it can, if you think about it
for example, 11 is dubs both in binary and decimal


int isdubs(int a, int b)
{
        return a == b ? 1 : 0;
}

>>9
AHURRR HURHRURHUR HAV U RED U SCIP 2DAY *DANCES AROUND LIKE A JACKASS*


int isdubs(int a, int b)
{
        return a == b;
}

>>10
Now do it in Scheme.

>>11
DO MY ANUS

(define (dubs? number base)
  (zero? (modulo (modulo number (expt base 2)) (+ base 1))))



boolean isDoubles(int checkem){

  if(String(checkem).length < 2){
    return false;
  }

  for(int i=0; i<10; ++i){
    if(String(checkem).indexOf(String(i)+String(i)) = String(checkem).length - 2){
      return true;
    }
  }
  return false;
}

ENTERPRIES

iscodroolpels:

HOOKIE KA DOOKIE U WINNER

PROC check em = (INT n, base) BOOL : n %* base = (n % base) %* base;
PROC (INT) BOOL binary dubs = check em(, 2);
print((check em(144, 10), binary dubs(14), binary dubs(3)))

#include <stdio.h>
#include <stdlib.h>
#define MAX_BASE 36
#include <math.h>
const char *alphabet = "0123456789ABCDEFGHIJKLMNOPQRSTUVWYZ";
const char *names[] = {
  NULL, NULL, "dubs", "trips",
  "quads", "quints", "sexts",
  "septs", "octs", "nons",
};

/* Actual dubs checking: four lines of code. */
int check(int num, int base) {
  int count = 0, digit = num % base;
  while (num % base == digit) {
    count++; num /= base;
  }
  return count;
}
void print_(int num, int b) {
  int n = 0;
  do {
    n++;
  }while(num/=b);
  int i = n;
  for(; i > 0; i--) {
    putchar(alphabet[num/(int)pow(b,i) % b]);
  }
}
int main(int argc, char **argv) {
  if (argc != 2) {
    fprintf(stderr, "Usage: %s <postnum>\n", argv[0]);
    return 1;
  }

  int postnum = atoi(argv[1]), base, result;

  if (postnum <= 0) {
    fprintf(stderr, "Invalid post number: %s\n", argv[1]);
    return 1;
  }

  for (base = 2; base < postnum && base < MAX_BASE; base++) {
    result = check(postnum, base);
    if (result < 2) continue;

    if (result >= 10) {
      printf("* %ds in base %d: ", result, base);
    } else {
      printf("* %s in base %d: ", names[result], base);
    }

    while (result--) {
      putchar(alphabet[postnum % base]);
    }
    print_(postnum, base);
    putchar('\n');
  }

  return 0;
}

dubs = lambda x: (int(x) / 100) % 11 == 0)

Obviously the final ) is a bug.

Also non-FIOC FIOC code

>>18

U MENA int(x) % 11

>>20

NO 211 % 11 == 2

int digits, x=1; bool repeat=FALSE;cin << digits;
while( ((digits/10)%10==digits%10) ){repeat=TRUE; x++; digits=(digits - (digits%10))/10;}
if(repeat) return x;
else segfault();

def dubs_checker(number):
    number = number - number / 100
    if len(str(number)) == 2:
        digit1, digit2 = str(number)[0], str(number)[1]
        digit1 = int(digit1)
        digit2 = int(digit2)
        if digit1 == digit2:
            return True
        else:
            return False
    else:
        raise Exception("Number is the wrong size!")

[b][i]LEAH QUALITY[i][/b]

x % 100 % 11

If you check it, mine isn't explicitly for dubs, but returns however many times the (singular) digits repeat from left to right, as a symbolic function (it isn't named or declared etc but it can be ENTERPRISE SCALED to resolve run-time requirements). A function with a wider scope (patterns such as '1212' ie not comparing just singular digits) would require something more sophisticated with more lines but that would mean I would actually have to program.

bampu pantsu