Markus Becker mtib

## .vimrc
call plug#begin('~/.vim/plugged')

" visuals
Plug 'yggdroot/indentline'

" formatting
Plug 'jiangmiao/auto-pairs'
Plug 'junegunn/vim-easy-align'

" file finders

## SSH-Tunnel.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                mtib
                / SSH-Tunnel.md
            
            
              Last active
              February 22, 2017 20:07
            
              
                SSH-Tunnel
              
          
    SSH-Tunnel

Optional Config

# /etc/ssd/sshd_config
ClientAliveInterval 30
ClientAliveCountMax 99999
GatewayPorts yes
AllowTcpForwarding yes

  
## homepage.html
<html>
<head>
    <title>COFFEE</title>
    <meta name="mobile-web-app-capable" content="yes">
    <meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=no">
    <link rel="shortcut icon" type="image/png" href="http://auvi.tibyte.net/favicon.png">
</head>
<body>
    <style>
body {

## server.go
package main

import (
	"fmt"
	"github.com/stianeikeland/go-rpio"
	"net/http"
	"os"
	"strings"
	"time"
)

## server.go
package main

import (
	"fmt"
	"github.com/stianeikeland/go-rpio"
	"net/http"
	"strings"
	"time"
)

## .index.html
<html>
    <head>
        <title>Start Page</title>
        <meta charset="utf-8">
    </head>
    <body onload="cstart()">
        <style>
body {
    color: #333333;
    font-family: "Terminus (TTF)";

## cheat.py
def rff(l, mi, ma):
    i = []
    for x in range(l):
        i.append(mi)
    while True:
        # intentionally not touching i[0]
        i[l-1] += 1
        for x in range(l-1, 0, -1):
            if i[x] == ma+1:
                i[x] = mi

## swenja3.hs
fib2 :: Int -> (Integer, Integer)
fib2 1 = (0, 1)
fib2 x = (snd las, fst las + snd las)
    where las = fib2 (x-1)

main = do
    putStrLn . show $ fib2 10

## swenja.hs
import Data.List
import Data.Maybe

wieVieleGleiche :: Eq a => a -> a -> a -> a -> [Int]
wieVieleGleiche a b c d = [ n + 1 | n <- (numv [] a [b, c, d] [])]

numv :: Eq a => [a] -> a -> [a] -> [Int] -> [Int]
numv _ _ [] numbers = numbers
numv pairs le ll numbers
    | elem le ll = if elem le pairs

## Story.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                mtib
                / Story.md
            
            
              Created
              December 31, 2016 11:58
            
          
    Silvester Story DND 5E

Spieler


Björn
Kilian
Johanna
Maya

Setup
	call plug#begin('~/.vim/plugged')

	" visuals
	Plug 'yggdroot/indentline'

	" formatting
	Plug 'jiangmiao/auto-pairs'
	Plug 'junegunn/vim-easy-align'

	" file finders
	<html>
	<head>
	<title>COFFEE</title>
	<meta name="mobile-web-app-capable" content="yes">
	<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=no">
	<link rel="shortcut icon" type="image/png" href="http://auvi.tibyte.net/favicon.png">
	</head>
	<body>
	<style>
	body {
	package main

	import (
	"fmt"
	"github.com/stianeikeland/go-rpio"
	"net/http"
	"os"
	"strings"
	"time"
	)
	<html>
	<head>
	<title>Start Page</title>
	<meta charset="utf-8">
	</head>
	<body onload="cstart()">
	<style>
	body {
	color: #333333;
	font-family: "Terminus (TTF)";
	def rff(l, mi, ma):
	i = []
	for x in range(l):
	i.append(mi)
	while True:
	# intentionally not touching i[0]
	i[l-1] += 1
	for x in range(l-1, 0, -1):
	if i[x] == ma+1:
	i[x] = mi
	fib2 :: Int -> (Integer, Integer)
	fib2 1 = (0, 1)
	fib2 x = (snd las, fst las + snd las)
	where las = fib2 (x-1)

	main = do
	putStrLn . show $ fib2 10
	import Data.List
	import Data.Maybe

	wieVieleGleiche :: Eq a => a -> a -> a -> a -> [Int]
	wieVieleGleiche a b c d = [ n + 1 \| n <- (numv [] a [b, c, d] [])]

	numv :: Eq a => [a] -> a -> [a] -> [Int] -> [Int]
	numv _ _ [] numbers = numbers
	numv pairs le ll numbers
	\| elem le ll = if elem le pairs