Skip to content

Instantly share code, notes, and snippets.

ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQDVJFD6p0LmN/MHJSIsCXvErqETYp8zF59WCSttQMD2C+yoli+LiiwPBn+AuWfGY0tlNsF7vR2TeRjy61agxNjQk2m6MmwjjAf8F9RjVI8uyoyCCYNSKagDBndqwSw0KKyhgwkDPJvwX7vDCt1ar4+VuJpdk7Bkv6XYFOrY/y2/xKWlrDf32MdNtwJqa68WuWUDbyGFtPSUJ/GlAvVhrEpjE/IUq544zM20niFU9wsLWzYEaesLIOB4WEqjlz5hM8xRbBXh2smHuWYkj5PBM48N9kJfEBJkMoIqV9jF630ZX7ce0Knj6YKMvHMVcxKlk3OHybrM66NDx4xYHStu0YkPgj8jVTL/cgLDh+JVOHdw83q2Hg+PffnfCy67dDaHbNirNlfTboSRyweOJJis5shFIxJcsWyM+dTDOn4agp1kdvsmfQH0WqRWg/j3Eno/HURVORCMahsnzuJFiT59WJ2Fq1S0YFlP4E0oySwNrwVeOpHwtU8cLwxWW+tqNqJCvZDG+9Pv1JfTa9eODywwnURQdM9fV4zOuAa84aaB2YJ9b9/m2N/7mtYNOBj9E+72KL3V5LfwgHmo/uCc5+T3bpoM8NHGqTNzfXTX9xAr1UrPXg3ZwsZS06weUUh1SplDiMBH67kei5nTKcNVxq4zaQtUtYzi0YznCsn8COLpAK/SOQ== niklas@Niklass-MacBook-Pro.local
ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABAQDM4dCzsln+r77vUypKy47W1Hlp1DtBLIFCscYTXuWZgcBnu/yl50p64HfYk5VPi95hUNsHujfdHWWg4dDLUVWnya7I6vbFJh1WIUscTB9+aOzTa7MkH5etliYWhecrb/UuAJ8Crx43nFpYlo2PVrePKy0jeODZqnWB5SMS7Bgl8hW6Rtcg4xuc2MnEprOINg0CzY1cCb9ZHL0UqBW9hzNiJRmhSgq+WLL4f07y2SsEewNg88KXcvfgYqKzxYdc1zNLb9zUhrw39dngAXTssG5SX2IdlOD8JsjxGPT2FovKuQsDOOKb0MibfETsT1qF1XQ4h7mNL7ig/rmmq7Nwnqrp niklas@grampa
@niklasb
niklasb / wtfregexp.py
Created December 26, 2014 12:12
solution for ADCTF2014 wtfregexp
import random
f = open("wtfregexp.pl", "r")
reg = f.readlines()[0]
reg = reg[reg.index('/')+1:-3]
clauses = []
maxi = 0
for l in reg.split(','):
l = l[3:-1].replace("[01]", ".")
@niklasb
niklasb / keybase.md
Created October 23, 2014 16:16
keybase.md

Keybase proof

I hereby claim:

  • I am niklasb on github.
  • I am nba (https://keybase.io/nba) on keybase.
  • I have a public key whose fingerprint is EFA9 7C96 C0CD 9721 101F 5D67 7784 A6C0 F0BD 08CF

To claim this, I am signing this object:

#include <bits/stdc++.h>
using namespace std;
#define R(i,e)for(I i=1;i<min(20,e);++i)
#define X(x) if(x<1||V[x])continue;V[x]=x;
#define J(a,b,c) X(a)X(b)X(c)
#define P printf
#define D "%2d "
typedef int I;I T=38;I main() {
I V[T];
R(h,20)R(c,20)R(s,20)
@niklasb
niklasb / primegen.cpp
Last active December 17, 2015 18:29
Generate primes < 10^9
#include <iostream>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
@niklasb
niklasb / gist:3318976
Created August 10, 2012 23:40
More from Savon
require 'savon'
url = 'http://kim-cm-bts01.scc.kit.edu/HeadingTreeService/HeadingTreeService.svc?wsdl'
client = Savon::Client.new do
wsdl.document = url
http.proxy = "http://dtun.de:9999"
http.auth.basic "heroku", "XXX"
end
@niklasb
niklasb / gist:3318047
Created August 10, 2012 21:16
Savon + Proxy
require 'savon'
require 'pry'
url = 'http://kim-cm-bts01.scc.kit.edu/HeadingTreeService/HeadingTreeService.svc?wsdl'
client = Savon::Client.new do
wsdl.document = 'http://kim-cm-bts01.scc.kit.edu/HeadingTreeService/HeadingTreeService.svc?wsdl'
http.proxy = "http://dtun.de:9999"
end
@niklasb
niklasb / googlers_minimal.py
Created April 19, 2012 01:43
Codejam 2012 - Dancing with the Googlers
def acc(p, total):
best, rest = divmod(total + 2, 3)
return (1, 0) if best >= p else (0, total and rest and best + 1 == p)
for i, line in enumerate(input() for _ in range(int(input()))):
_, S, p, *totals = map(int, line.split())
a, s = map(sum, zip(*(acc(p, total) for total in totals)))
print("Case #%d: %d" % (i + 1, a + min(s, S)))
@niklasb
niklasb / convert-to-mp4.sh
Created January 29, 2012 18:45
Convert video to MP4 for Android
#!/bin/bash
if [[ $# != 2 ]]; then
echo >&2 "Syntax: $0 infile outfile"
fi
ffmpeg -i "$1" -s 480x320 -vcodec mpeg4 -acodec libfaac -ac 1 -ar 16000 -r 15 -ab 32000 -aspect 3:2 -threads 12 "$2"