sleibrock

# character thing

weight_table = [
  (100, "Humans"),
  (50, "Elves"),
  (25, "Dragonborn"),
  (20, "Changeling"),
  ]

def create_roll_table():

sleibrock

unsigned char iter;
for(unsigned int y=0; y < h; y++)
{
    for(unsigned int x=0; x < w; x++)
    {
        iter  = 0;
        z_re  = 0;
        z_im  = 0;
        z_re2 = 0;
        z_im2 = 0;

sleibrock

Maps to Get

Using these maps to host a killing floor 2 server

kf_westlondon https://steamcommunity.com/sharedfiles/filedetails/?id=733191110&searchtext=

kf_manor https://steamcommunity.com/sharedfiles/filedetails/?id=682290186&searchtext=

sleibrock

fn solution(num: i32) -> i32 {
  let mut acc = 0;
  for x in 0..num {
    match (x % 3, x % 5) {
      (0, 0) => acc += x,
      (0, _) => acc += x,
      (_, 0) => acc += x,
      _ => {}
    }
  }

sleibrock

Keybase proof

I hereby claim:

• I am sleibrock on github.
• I am sleibrock (https://keybase.io/sleibrock) on keybase.
• I have a public key whose fingerprint is 1406 3C8D 0ADD C7DB 2CC0 467B 36D7 98FF F8C6 90B9

To claim this, I am signing this object:

sleibrock

# Replace single occurance of CAP with cap, then process next Rule.
RewriteRule ^([^A]*)A(.*)$ $1a$2
RewriteRule ^([^B]*)B(.*)$ $1b$2
RewriteRule ^([^C]*)C(.*)$ $1c$2
RewriteRule ^([^D]*)D(.*)$ $1d$2
RewriteRule ^([^E]*)E(.*)$ $1e$2
RewriteRule ^([^F]*)F(.*)$ $1f$2
RewriteRule ^([^G]*)G(.*)$ $1g$2
RewriteRule ^([^H]*)H(.*)$ $1h$2
RewriteRule ^([^I]*)I(.*)$ $1i$2

sleibrock

-- Enter your code here. Read input from STDIN. Print output to STDOUT
import Control.Monad (forM)

hypot :: Floating a => a -> a -> a -> a -> a
hypot lx ly rx ry = sqrt $ (((rx-lx)**2)+((ry-ly)**2))

-- Fold over a list of points, taking the Euclidean distance, and 
-- rotate the next point between each call until we reach an empty list
fp :: Floating a => a -> [a] -> [[a]] -> a
fp acc (lx:ly:[]) ((rx:ry:[]):t) = fp (acc + (hypot lx ly rx ry)) [rx,ry] t

sleibrock

#!/usr/bin/env python
#-*- coding: utf-8 -*-

"""
Merge two folders together using a diff digest program
If a folders have multiple files of the same digest, 
ignore the duplicates and proceed to copy the unique files 
into a new target folder. If the folder doesn't exist, 
create a new one.

sleibrock

#lang racket

;; Compute the area under a curve and the volume of the solid between L and R
;; first line is the bases, second is the exponents, third is the L and R limits
(define bases (map string->number (string-split (read-line) " ")))
(define expos (map string->number (string-split (read-line) " ")))
(define-values
 (left right)
 (apply values (map string->number (string-split (read-line) " "))))

sleibrock

#lang racket

;; Compute e^x with an approximation
;; 1 + x + x^2/2! + x^3/3! + ... up to ten terms
;; No Defines were hurt in the making of this program
(for-each
 (compose
  displayln
  (λ (s) (apply (λ (a b) (string-append a "." (substring b 0 (if (< (string-length b) 4) (string-length b) 4)))) (string-split s ".")))
  number->string