husobee

## vigenere.go
package main

import (
	"flag"
	"fmt"
)

// plaintext flag
var plaintext = flag.String("plaintext", "", "plaintext is the message you want to cipher")

## wemux.conf
host_list=(husobee)
host_groups=(wheel engineering)
default_client_mode="pair"
allow_server_change="true"
allow_server_list="true"
socket_prefix="/tmp/wemux"

## coverage.html
<!DOCTYPE html>
<html>
        <head>
                <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
                <style>
                        body {
                                background: black;
                                color: rgb(80, 80, 80);
                        }
                        body, pre, #legend span {

## main.go
package main

import (
        "flag"
        "fmt"
        "time"

        "golang.org/x/crypto/bcrypt"
)

## nyan.c
#include <stdlib.h>
#include <ncurses.h>
#include <unistd.h>

/* our cat */
const char nyan_cat[4][12] = {
    ",------,   \n",
    "|   /\\_/\\\n",
    "|__( ^ .^) \n",
    "\"\"  \"\" \n"};

## main.go
package main

import (
	"fmt"
	"os"
	"os/signal"
	"syscall"
	"time"
)

## main.go
package main

import (
	"fmt"
)

func reverse(input int) int {
	var result int
	for ; input != 0; input = input / 10 {
		result = input%10 + 10*result

## main.go
package main

import (
	"fmt"
)

func reverseStr(s string) string {
	input := []byte(s)
	for i := 0; i < len(input)/2; i++ {
		input[i], input[(len(input)-1)-i] = input[(len(input)-1)-i], input[i]

## digital_root.py
def digital_root(n):
    """ digital_root - recursively figure out the digital root of a number"""
    s = 0 # s -> running sum
    while n > 0:
        # take each digit from the number by running mod 10 (ones position in base 10 number)
        s += int(n%10)
        # reduce the number by a factor of 10 to remove the ones position
        n = int(n/10)
    if s >= 10:
        # if the num is greater than or equal to 10 recursively call self

## fib.py
from functools import reduce, lru_cache

fib_bad = lambda n:reduce(lambda x,n:[x[1],x[0]+x[1]], range(n),[0,1])[0]


def fib_naive(n):
    """ fib_naive - naive solution to the fibonacci """
    a,b = 1,1
    for i in range(n-1):
      a,b = b,a+b
	package main

	import (
	"flag"
	"fmt"
	)

	// plaintext flag
	var plaintext = flag.String("plaintext", "", "plaintext is the message you want to cipher")
	host_list=(husobee)
	host_groups=(wheel engineering)
	default_client_mode="pair"
	allow_server_change="true"
	allow_server_list="true"
	socket_prefix="/tmp/wemux"
	<!DOCTYPE html>
	<html>
	<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<style>
	body {
	background: black;
	color: rgb(80, 80, 80);
	}
	body, pre, #legend span {
	#include <stdlib.h>
	#include <ncurses.h>
	#include <unistd.h>

	/* our cat */
	const char nyan_cat[4][12] = {
	",------, \n",
	"\| /\\_/\\\n",
	"\|__( ^ .^) \n",
	"\"\" \"\" \n"};
	def digital_root(n):
	""" digital_root - recursively figure out the digital root of a number"""
	s = 0 # s -> running sum
	while n > 0:
	# take each digit from the number by running mod 10 (ones position in base 10 number)
	s += int(n%10)
	# reduce the number by a factor of 10 to remove the ones position
	n = int(n/10)
	if s >= 10:
	# if the num is greater than or equal to 10 recursively call self
	from functools import reduce, lru_cache

	fib_bad = lambda n:reduce(lambda x,n:[x[1],x[0]+x[1]], range(n),[0,1])[0]


	def fib_naive(n):
	""" fib_naive - naive solution to the fibonacci """
	a,b = 1,1
	for i in range(n-1):
	a,b = b,a+b