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
my @l = 'aoc-expenses.txt'.IO.lines; | |
# part 1 | |
say [*] @l.combinations(2).first: *.sum == 2020; | |
# part 2 | |
say [*] @l.combinations(3).first: *.sum == 2020; |
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
### Keybase proof | |
I hereby claim: | |
* I am citizen428 on github. | |
* I am citizen428 (https://keybase.io/citizen428) on keybase. | |
* I have a public key whose fingerprint is E183 E826 AAA2 71D9 A25E B8E9 EF16 E5E6 87B2 A218 | |
To claim this, I am signing this object: |
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
class EvenNumbers: CollectionType { | |
let startIndex : Int | |
let endIndex : Int | |
init(start: Int, end: Int) { | |
self.startIndex = start | |
self.endIndex = end | |
} | |
convenience init() { |
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 Foundation | |
extension Array { | |
func each(task: (Element) -> ()) { | |
for element in self { | |
task(element) | |
} | |
} | |
func eachWithIndex(start: Int? = nil, task: (Int, Element) -> ()) { |
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
# | |
# A colorful, friendly, multiline theme with some handy features. | |
# Based on the 'giddie' theme by Paul Gideon Dann. | |
# | |
# Authors: | |
# Michael Kohl <citizen428@gmail.com> | |
# Paul Gideon Dann <pd@gmail.com> | |
# Sorin Ionescu <sorin.ionescu@gmail.com> | |
# | |
# Features: |
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
defmodule FizzBuzz do | |
def compute do | |
receive do | |
n -> IO.puts compute(n) | |
end | |
compute | |
end | |
defp compute(n) do | |
case {rem(n, 3), rem(n, 5)} do |
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
loop { print ">> " ; puts("=> %s" % eval(gets.chomp!)) } |
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
@-moz-document url(http://derstandard.at/) { | |
div.section.inland { display: none } | |
} |
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
module Kernel | |
def with(obj, &block) | |
obj.instance_eval &block | |
obj | |
end | |
end |
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
class Proc | |
def prim_call(stack) | |
forth_arity = self.arity - 1 | |
if stack.size < forth_arity | |
puts "Buffer underrun" | |
return stack.clear | |
end | |
forth_arity > 0 ? self.call(stack, *stack.pop(forth_arity)) : call(stack) | |
end | |
end |
NewerOlder