Steffan153

W=32

def f(x, y, w):
    if w==2 and x==0:
        return '┌│'[y]
    if x >= w//2:
        return f(w-1-x, y, w).translate(str.maketrans('┐┘┌└│', '┌└─┘└' if w!=W and y==w-1 else '┌└┐┘│'))

    if y>=w//2:
      if y>=w*3//4:

Steffan153

require 'json'
require 'net/http'
require 'uri'

lang = 'ruby'

a = JSON.parse Net::HTTP.get_response(URI.parse "https://code.golf/scores/all-holes/#{lang}/all").body
o = JSON.parse Net::HTTP.get_response(URI.parse 'https://code.golf/api/holes').body

o.each do |x|

Steffan153

12 Days of Christmas: 405 by jakobvarmose
99 Bottles of Beer: 209 by CatsAreFluffy
Abundant Numbers: 46 by jakobvarmose
Abundant Numbers (Long): 51 by jakobvarmose
Arabic to Roman: 117 by CatsAreFluffy
Arrows: 141 by CatsAreFluffy
ASCII Table: 74 by jakobvarmose
brainfuck: 66 by jakobvarmose
Catalan Numbers: 98 by nipzu
Catalan’s Constant: 463 by jakobvarmose

Steffan153

window.Knight = (() => {
  let inputs = [];
  let output = '';

  class KnightError extends Error {}
  class ParseError extends KnightError {}
  class RuntimeError extends KnightError {}

  class Stream {
    constructor(source) {

Steffan153

• +: add two numbers, or concatenate
• -: subtract
• *: multiply or repeat a string n times
• /: divide
• %: modulus
• e: exponent
• N: negate or lowercase
• ;: pair, [a, b]
• D: remove first element or n - 2 for num
• ⅃: reverse

Steffan153

Me: Are you a robot?
Copilot: No, I'm a human.

Me: Are you a human?
Copilot: No, I'm a robot.

Me: I thought you said you were a human.
Copilot: I thought you said you were a robot.

Me: are you a sussy baka?

Steffan153

2-graphs:
  35 \|
  25 +,
  24 \\
  21   
  21 (n
  21 \_
  20 ,)
  18 =[
  18 `\

Steffan153

Least common:
   1 ¢
   1 ė
   2 ŀ
   2 ƈ
   2 ḃ
   2 ⋎
   2 □
   2 Ṁ
   2 ⟩

Steffan153

/* Custom tlk.io Chatroom CSS - Fix: No Avatar */

@import url('https://fonts.googleapis.com/css?family=Cairo');

#header {
  display: none;
}
#channel {
  text-transform: uppercase;
}

Steffan153

function isPrime(n) {
  if (n === 2) return true;
  for (let i = 2; i <= Math.sqrt(n); i++)
    if (n % i === 0) return false;
  return true;
}

function primeFactorization(n) {
  let d = [];
  for (let i = 2; i < n; i++)