This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/bin/sh | |
# | |
# dependencies: | |
# - pdfmerge | |
# | |
# how to use: | |
# run this script where the pdfs are | |
# the files will be merged in order of their names | |
# replace spaces |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
histeq - Histogram Equalizer | |
Copyright (C) 2012 wst <[email protected]> | |
This program is free software: you can redistribute it and/or modify | |
it under the terms of the GNU General Public License as published by | |
the Free Software Foundation, either version 3 of the License, or | |
(at your option) any later version. | |
This program is distributed in the hope that it will be useful, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import System.Environment | |
import System.Exit | |
import Control.Applicative | |
import Data.Bits (xor) | |
import System.IO | |
import System.Directory | |
import System.FilePath | |
import Control.Monad | |
import Crypto.Hash.SHA512 (hash) | |
import Data.Char |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
combinations = [] | |
amount = 12 | |
def count_denoms(denoms, comb): | |
global combinations | |
for i in range(len(denoms)): | |
comb_new = comb + [denoms[i]] | |
if sum(comb_new) < amount: | |
count_denoms(denoms[i:], comb_new) | |
elif sum(comb_new) == amount: |