weeble

javascript:styles='body {width: 800px; margin-left: auto; margin-right: auto; position:relative; margin-top:0;}'; newSS = document.createElement('link'); newSS.rel = 'stylesheet'; newSS.href = 'data:text/css,' + escape(styles); document.documentElement.childNodes[0].appendChild(newSS); void 0

weeble

title Robot Repairs 1.2
author Weeble
homepage www.twitter.com/weeble
run_rules_on_level_start
again_interval 0.05
key_repeat_interval 0.12
noaction

========
OBJECTS

weeble

title Robot Repairs 1.2
author Weeble
homepage www.twitter.com/weeble
run_rules_on_level_start
again_interval 0.05
key_repeat_interval 0.12
noaction

========
OBJECTS

weeble

title tiny treasure hunt 1.1
author Weeble
homepage www.twitter.com/weeble
run_rules_on_level_start

(
Release history:

1.0
   * First release

weeble

javascript:(function(){var newcss="a.media-thumbnail { display: none; }";if("\v"=="v"){document.createStyleSheet().cssText=newcss}else{var tag=document.createElement("style");tag.type="text/css";document.getElementsByTagName("head")[0].appendChild(tag);tag[(typeof document.body.style.WebkitAppearance=="string")?"innerText":"innerHTML"]=newcss}})();

weeble

from collections import namedtuple

def flatten(xs):
    return sum(xs, [])

Node = namedtuple('Node', 'value children')

def leaf(name):
    return Node(name, [])

weeble

import numpy as np

def index_of_highest_bit(x):
    p = 1
    i = 0
    while p<x:
        p <<= 1
        i += 1
    return i

weeble

weeble

weeble

print([f"Hello, {first_name} {last_name[0]}. Dork." for first_name, last_name in [[next(x for x in (input(prompt) for _ in iter(object, None)) if x) for prompt in ["First Name: ", "Last Name: "]]]][0])