Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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
// https://github.com/hakatashi/unicue-lang | |
// http://unicode.org/ucd/ | |
const fs = require("fs") | |
const parser = require("codepoints/parser") | |
const codepoints = parser("UCD") | |
let res = "" | |
let depth = 0 |
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 Hanoi | |
STACK = { :A => 0, :B => 1, :C => 2 } | |
BYTES = { :u8 => 0, :u16 => 1, :u32 => 2, :u64 => 3 } | |
def pair(x, y) | |
a, b = STACK[x], STACK[y] | |
raise "" if a == b | |
b -= 1 if a < b | |
[a, b] | |
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
from Crypto.Cipher import AES | |
import base64 | |
def encrypt(text): | |
key = "SECCON" | |
s = '' | |
for i in range(len(text)): | |
s += chr((((ord(text[i]) - 0x20) + (ord(key[i % len(key)]) - 0x20)) % (0x7e - 0x20 + 1)) + 0x20) | |
return s |
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
<!DOCTYPE html> | |
<html lang="en"> | |
<head> | |
<meta charset="UTF-8"> | |
<meta name="viewport" content="width=device-width, initial-scale=1.0"> | |
<meta http-equiv="X-UA-Compatible" content="ie=edge"> | |
<title>Document</title> | |
<style> | |
#disp { |
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
push 0 | |
loop: | |
push 0 readi | |
push 0 retrieve | |
dup push 10 sub jz yes: | |
dup push 12 sub jz yes: | |
dup push 14 sub jz yes: | |
dup push 15 sub jz yes: | |
dup push 16 sub jz yes: | |
dup push 18 sub jz yes: |
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 10 | |
0 9 a a | |
a 9 a 0 | |
a 0 r 0 | |
+++++++++[-<[->>+>+<<<]>>>[-<<<+>>>]<<] | |
>[-<<+>>]< | |
, |
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
git config --local user.name n4o847 | |
git config --local user.email 22975590+n4o847@users.noreply.github.com |
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 Hanoi | |
STACK = { :A => 0, :B => 1, :C => 2 } | |
BYTES = { :u8 => 0, :u16 => 1, :u32 => 2, :u64 => 3 } | |
def pair(x, y) | |
a, b = STACK[x], STACK[y] | |
raise "" if a == b | |
b -= 1 if a < b | |
[a, b] | |
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
def search(size) | |
dir = 1 | |
mem = {} | |
pos = 0 | |
id = 0 | |
mem[0] = 0 | |
id += 1 | |
loop do |
OlderNewer