This file contains hidden or 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
const magic = 0x46697a7a | |
const witchcraft = magic ^ (0x41c << 16) | |
const u = x => a => b => (x >> a) + (x & b) | |
const v = x => a => b => x > a ? x - b : x | |
const w = x => u(u(u(x)(16)(0xffff))(8)(0xff))(4)(0xf) | |
const rin = x => s => !!parseInt(x) ? s : x + s | |
const c = x => a => b => String.fromCharCode((x >> a) & b) | |
const cccc = x => c(x)(24)(0xff)+c(x)(16)(0xff)+c(x)(8)(0xff)+c(x)(0)(0xff) | |
const fizz = x => !(v(u(u(u(w(x))(2)(3))(2)(3))(2)(3))(2)(3)) | |
const buzz = x => !(v(v(v(w(x))(14)(15))(4)(5))(4)(5)) |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => main()) | |
function ecmascriptify(input) { | |
const regs = {} | |
const weEczemaSkriptNow = input | |
.split('\n') |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => main()) | |
const evil = eval | |
class DepthCounter { | |
constructor() { | |
this.depth = 0 |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => { | |
const args = process.argv.slice(2) | |
const rounds = args[0] | |
main(rounds) | |
}) |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => { | |
main() | |
}) | |
const dist = (i, j) => Math.abs(i) + Math.abs(j) |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => { | |
main() | |
}) | |
function dedupeConcat(p, c) { | |
const deduped = c.filter(item => !p.includes(item)) |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => { | |
main() | |
}) | |
const scanner = (depth, range, t = 0) => { | |
range -= 1 |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => main()) | |
function leftpad(str, char = 0, len = 2) { | |
let res = str.slice() | |
if (str.length < len) { | |
const pad = len - str.length |
This file contains hidden or 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 <stdio.h> | |
#include <stdint.h> | |
#include <stdbool.h> | |
int64_t judge_one(int64_t a, int64_t b) { | |
const int pairs = 40000000; | |
int64_t total = 0; | |
for (int i=0; i<pairs; i++) { | |
a = (a * 16807) % INT32_MAX; | |
b = (b * 48271) % INT32_MAX; |
This file contains hidden or 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
// -*- node.jz -*- | |
let input = '' | |
process.stdin.on('readable', () => input += process.stdin.read() || '') | |
process.stdin.on('end', () => main()) | |
const spin = (programs, size) => { | |
while (size--) programs.unshift(programs.pop()) | |
} |