| <body onload=z=c.getContext`2d`,setInterval(`c.width=W=150,Y<W&&P<Y&Y<P+E|9<p?z.fillText(S++${Y=`,9,9|z.fillRect(p`}*0,Y-=--M${Y+Y},P+E,9,W),P))):p=M=Y=S=6,p=p-6||(P=S%E,W)`,E=49) onclick=M=9><canvas id=c> |
| #define RenameFunction(a, b) Message("Found %s at %a\r\n", b, a); MakeName(a, b) | |
| #define START_ADDR 0x00400000 | |
| static main() { | |
| // Decodes/Encodes | |
| FindCInPacketDecodeFunction("83 F8 01", "CInPacket::Decode1"); | |
| FindCInPacketDecodeFunction("83 F8 02", "CInPacket::Decode2"); | |
| FindCInPacketDecodeFunction("83 F8 04", "CInPacket::Decode4"); |
| import csv | |
| import urllib.request | |
| url = "http://nopaystation.com/tsv/PS3_GAMES.tsv" | |
| print('Downloading PS3_GAMES.tsv...') | |
| urllib.request.urlretrieve(url, 'PS3_GAMES.tsv') | |
| newlist = [] | |
| with open('PS3_GAMES.tsv', newline='', encoding="utf8") as csvfile: | |
| listreader = csv.reader(csvfile, delimiter=' ', quotechar='"') |
| #include <time.h> // Robert Nystrom | |
| #include <stdio.h> // @munificentbob | |
| #include <stdlib.h> // for Ginny | |
| #define r return // 2008-2019 | |
| #define l(a, b, c, d) for (i y=a;y\ | |
| <b; y++) for (int x = c; x < d; x++) | |
| typedef int i;const i H=40;const i W | |
| =80;i m[40][80];i g(i x){r rand()%x; | |
| }void cave(i s){i w=g(10)+5;i h=g(6) | |
| +3;i t=g(W-w-2)+1;i u=g(H-h-2)+1;l(u |
| WAYLAND_PROTOCOLS=/usr/share/wayland-protocols | |
| # wayland-scanner is a tool which generates C headers and rigging for Wayland | |
| # protocols, which are specified in XML. wlroots requires you to rig these up | |
| # to your build system yourself and provide them in the include path. | |
| xdg-shell-protocol.h: | |
| wayland-scanner server-header \ | |
| $(WAYLAND_PROTOCOLS)/stable/xdg-shell/xdg-shell.xml $@ | |
| xdg-shell-protocol.c: xdg-shell-protocol.h |
sed -E -f solver.sed input where input is a file containing the maze.
For best results, resize your terminal to match the height of the maze. To disable animations, delete the lines containing p.
The solver assumes the following:
# \nSES) and end (E)| // ~ 120k log op/s | |
| (function() { | |
| var originalArrayValueOf = Array.prototype.valueOf; | |
| var logs = {}; | |
| var index = 1; | |
| function hasher(str) { | |
| var target = Array.from(str); | |
| target.length > 16 && (target = target.slice(0, 16)); // perf: avoid alloc | |
| return target | |
| .reduce(function(acc, i) { |
/opt)bin/directory of the toolchain to $PATHexport PATH=$PATH:/opt/armv6-eabihf--glibc--bleeding-edge-2020.08-1| names = { | |
| 43 => 'e', | |
| 'prog' => 'x', # the program will be stored in this variable | |
| 'template' => 'c', | |
| 0 => 'ee', # register? | |
| 1 => 'ex', | |
| 2 => 'ec', | |
| 4 => 'xe', | |
| 8 => 'xx', | |
| 16 => 'xc', |
| int | |
| stk | |
| [ 2 << 14 | |
| ]; int ps = 0; int kofi(){char | |
| a [ 2 << 15 ]; int c[ 2<< | |
| 15 ];int n; | |
| int s;char d[ 2<< | |
| 14 ];int p ; int |
