andreis

print("\n".join("".join("*" if i in (0, 9, j, 9-j) else " " for j in range(10)) for i in range(10)))
print("====")
print("".join(map(lambda i: ("*" if i//10 in (0, 9, i%10, 9-(i%10)) else " ") + ("\n" if (i+1) % 10 == 0 else ""), range(100))))
print("====")
print("".join(map(lambda i: ([""]*9+["\n"])[(i>>1)%10] if i&1 else "*" if (i>>1)//10 in (0, 9, (i>>1)%10, 9-((i>>1)%10)) else " ", range(200))))

andreis

Keybase proof

I hereby claim:

• I am andreis on github.
• I am andrei91 (https://keybase.io/andrei91) on keybase.
• I have a public key ASBrLotJHYdsq2yh2hM-e8QUs7z9fFcOIPtaPKtr22HMXwo

To claim this, I am signing this object:

andreis

#!/usr/bin/env python3

import argparse, sys, select
from enum import Enum
from random import randint

Mode = Enum("Mode", "white yellow mixed random")


def config():

andreis

Keybase proof

I hereby claim:

• I am andreis on github.
• I am andrei5 (https://keybase.io/andrei5) on keybase.
• I have a public key ASC1DvuIodIGumUVcCqkLGRyIZ_H1HD-3pa-e58TucrbkAo

To claim this, I am signing this object:

andreis

# turn until you get three hexagons changed to get here
H1 = ["AC", "AB", "ACD"]
# turn until you get two hexagons changed to get here
H2 = ["BCF", "ACF", "BF"]
# turn until you get three hexagons changed to get here
H3 = ["CD", "BC", "AB", "AF", "EF", "CDE"]

# this is my status, look at the hexagons to determine which ones are open
status = set("ABDE") # 110110

andreis

data = map(int, open("input.txt").readlines()[0].strip().split(","))


class Computer(object):
    def __init__(self, data, stdio=None):
        self.ram = list(data)
        self.pc = 0
        self.halt = False
        self.stdio = stdio

andreis

How to use present:

• go get golang.org/x/tools/cmd/present
• present -notes
• hit N while in the browser to open the presenter notes window

andreis

// https://leetcode.com/problems/invert-binary-tree
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func invertTree(root *TreeNode) *TreeNode {

andreis

Name	Artist	Composer	Album	Grouping	Work	Movement Number	Movement Count	Movement Name	Genre	Size	Time	Disc Number	Disc Count	Track Number	Track Count	Year	Date Modified	Date Added	Bit Rate	Sample Rate	Volume Adjustment	Kind	Equalizer	Comments	Plays	Last Played	Skips	Last Skipped	My Rating	Location
sonicuniverse-192-mp3																		11/1/16, 1:44 PM	192	44100		Internet audio stream			1	11/1/16, 1:44 PM				http://ice1.somafm.com/sonicuniverse-192-mp3
beatblender-128-aac																		11/1/16, 1:45 PM		44100		Internet audio stream			1	11/1/16, 1:45 PM				http://ice1.somafm.com/beatblender-128-aac
suburbsofgoa-128-mp3																		11/1/16, 1:45 PM	128	44100		Internet audio stream			1	11/1/16, 1:45 PM				http://ice1.somafm.com/suburbsofgoa-128-mp3
thetrip-128-mp3																		11/1/16, 1:46 PM	128	44100		Internet audio stream			1	11/1/16, 1:46 PM				http://ice1.somafm.com/thetrip-128-mp3
7soul-128-aac																		11/1/16, 1:48 PM		44100		Internet audio stream			1	11/1/16, 1:48 PM				http://ice1

andreis

function shuffle(arr) {
   if (!Array.isArray(arr)) { throw "need an array as input"; }
   if (arr.length < 2) { return arr; }
   var pick = Math.floor(Math.random() * (arr.length));
   var tmp = arr[pick]; arr[pick] = arr[0]; arr[0] = tmp;
   return [arr[0]].concat(shuffle(arr.slice(1)));
 }
 shuffle([1,2,3,4,5])