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
XTerm*faceName: mononoki | |
xterm*faceSize: 12 | |
xterm*termName: xterm-color | |
xterm*eightBitInput: false | |
*.vt100.metaSendsEscape: true | |
! special | |
xterm*foreground: #586e75 |
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
Snacks | |
- Pom beeears + chipsy | |
- something to have with coffe? | |
Lunch Saturday (carbonara) | |
- Slanina (a big chunky piece of it) | |
- Pasta (we have, I think) | |
Dinner Saturday (pork + pepper/cucumber salad) | |
- Veprova kotleta x (a few, a couple each?) |
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
NB. first attempt, took me a whole hour | |
sub1 =: 1 & (-~) | |
subtractindices =: ((# sub1) @: #) | |
forwardindices =: i. @: # | |
revindices =: (subindices - forwardindices) | |
revarray =: (({~) revindices) | |
NB. alternative implementation, I realised you could give a -ve number to "i." | |
revindices2 =: (i. @: - @: #) | |
revarray2 =: ({~) revindices2 |
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
#!/usr/bin/python | |
import sys | |
upto = int(sys.argv[1]) | |
stringsForModulus = { | |
3: "fizz", | |
5: "buzz", | |
7: "bazz" |
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
#include <stdint.h> | |
#include <gfxfont.h> | |
#include <SPI.h> | |
#include <Wire.h> | |
#include <Adafruit_GFX.h> | |
#include <Adafruit_SSD1306.h> | |
char msg[32] = { // can't be bothered counting | |
0x44, 0x6f, 0x62, 0x72, 0xfd, 0x20, 0x64, 0x65, 0x6e, 0x2c, 0x20, 0x6a, 0x61, 0x6b, 0x20, 0x73, 0x65, 0x20, 0x6d, 0xe1, 0xb9, 0x3f, | |
NULL |
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
// Slightly updated 5x7 font for ISO8859-2 | |
#ifndef FONT5X7_H | |
#define FONT5X7_H | |
#ifdef __AVR__ | |
#include <avr/io.h> | |
#include <avr/pgmspace.h> | |
#elif defined(ESP8266) | |
#include <pgmspace.h> |
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
let pair_multiply s1 s2 = | |
[ for x in s1 do | |
for y in s2 do | |
yield (x,y) ] | |
let enumerate (a:'a[]) = | |
Array.mapi (fun i x -> (i,x)) a | |
let pandigital (n:int) = | |
let a = string(n).ToCharArray() |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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
(* | |
Problem 31 - Coin sums | |
---------------------- | |
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation: | |
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p). | |
It is possible to make £2 in the following way: | |
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p | |
How many different ways can £2 be made using any number of coins? | |
*) |
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
$ sysbench --num-threads=1 --test=cpu --cpu-max-prime=20000 --validate run | |
sysbench 0.4.12: multi-threaded system evaluation benchmark | |
Running the test with following options: | |
Number of threads: 1 | |
Additional request validation enabled. | |
Doing CPU performance benchmark |