Skip to content

Instantly share code, notes, and snippets.

Merge bank transaction fees into the main transaction in GnuCash.
This script searches a given account for "fee" transactions with a certain
description. It then tries to find the corresponding "real" transaction, adds
the fee amount to the real transaction, and deletes the fee transaction.
Assumptions: "fee" transactions come (not necessarily consecutively) after
coyotebush / falling.c
Created Apr 13, 2014
My submissions to KTH Challenge 2014
View falling.c
#include <stdio.h>
int main() {
int D, n1, n2;
scanf("%d", &D);
for (n1 = 0; n1 < D; n1++)
for (n2 = 0; n2 < n1; n2++)
if ((n1 + n2) * (n1 - n2) == D) {
printf("%d %d\n", n2, n1);
return 0;
#!/usr/bin/env python
import struct
import sys
import binascii
# def str2bytes(string):
# return "".join("\\x" + "{0:02x}".format(ord(x)) for x in string)
def compare(bs, ks, tag=None):
if bs != ks:
coyotebush / foss.tex
Created Oct 31, 2014
A five-minute introduction to the free software movement
View foss.tex

Keybase proof

I hereby claim:

  • I am coyotebush on github.
  • I am coyotebush ( on keybase.
  • I have a public key whose fingerprint is 8AE8 3D54 29C7 2B78 54C0 A274 F745 EA21 9F68 D026

To claim this, I am signing this object:

View sdo.rkt
(define-syntax (sdo stx)
(syntax-case stx (in-list)
[(sdo ([name <- comp] ...) final)
(foldr (lambda (n c next) #`(bind #,c (lambda (#,n) #,next)))
(syntax->list #'(name ...))
(syntax->list #'(comp ...)))]))
View Topics.hs
{-# LANGUAGE ExistentialQuantification, ImpredicativeTypes, MultiParamTypeClasses, FlexibleInstances #-}
module Topics (topics) where
import XMonad
import XMonad.StackSet
import XMonad.Layout.Grid
import XMonad.Layout.PerWorkspace
import XMonad.Layout.Tabbed
data LayoutBox a = forall l. LayoutClass l a => LB (l a)
coyotebush / C027_mdm_or_eth.cpp
Created May 27, 2015
switch between cellular modem and ethernet on u-blox C027
View C027_mdm_or_eth.cpp
// Include in your project:
// plus, ONLY when compiling without CELLULAR_NETWORK:
#include "mbed.h"
// ...
View IndexLab-min.hs
import Data.List
import qualified Data.Map as Map
type WordMap = Map.Map String [Int]
wordsByLine _ [] = Map.empty
wordsByLine n (s:ss) = Map.unionWith (++) (Map.fromList [(w, [n]) | w <- nub $ words s])
(wordsByLine (n + 1) ss)
printWords = mapM_ (putStrLn . formatWord) . Map.toList
View execpwd.c
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
int main () {
printf("1: %s\n", getenv("PWD"));
setenv("PWD", "/etc", 1);
printf("2: %s\n", getenv("PWD"));
execl("/usr/bin/printenv", "/usr/bin/printenv", "PWD", NULL);