christian-oudard

def gcd_extended(a, b):
    """
    Compute the greatest common divisor of a and b, along with Bezout
    coefficients s and t, such that gcd(a, b) a*s + b*t.
    Returns (gcd(a, b), s, t, lcm(a, b)).

    23 * 240 - 120 * 46 = 2
    >>> gcd_extended(240, 46)
    (2, -9, 47, 5520)
    """

christian-oudard

Human:
  Which version of Claude am I speaking with?


Claude:
  You are speaking with Claude, an AI assistant created by Anthropic. My knowledge
  base was last updated in August 2023, but I don't have information on specific
  version numbers. How may I assist you today?

christian-oudard

from collections import deque
from contextlib import contextmanager
from curses.ascii import ESC, ETX
import sys
import termios
import tty

ESC = chr(ESC)
ETX = chr(ETX)

christian-oudard

$ cargo run --example=greeter_server

   Compiling grpcio-sys v0.12.1+1.46.5-patched
error: failed to run custom build command for `grpcio-sys v0.12.1+1.46.5-patched`

Caused by:
  process didn't exit successfully: `/home/user/third-party-code/grpc-rs/target/debug/build/grpcio-sys-1aa460d92b7351db/build-script-build` (exit status: 101)
  --- stdout
  cargo:rerun-if-changed=grpc_wrap.cc
  cargo:rerun-if-changed=grpc

christian-oudard

#!/bin/sh

# /etc/acpi/handler.sh

TARGET_UID=1000
my_pactl() {
    setpriv --reuid $TARGET_UID sh -c "XDG_RUNTIME_DIR=/run/user/$TARGET_UID pactl $*"
}

case "$1" in

christian-oudard

#! /usr/bin/bash

# Account information.
OP_EMAIL=<email>
OP_MOUNTPOINT=/home/<username>/pCloudDrive
OP_USER_ID=<user-id>  # Gotten from `op account list`.

# Stop server.
if [[ $1 == 'stop' ]]; then
    expect -f - >/dev/null <<END_EXPECT

christian-oudard

# How many unique ways are there to add positive integers to get the number N?
# https://oeis.org/A000041

from itertools import count, chain, islice


def partitions():
    """
    >>> list(islice(partitions(), 20))
    [1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490]

christian-oudard

numbers = [4, 6, 1, 3, 4, 4, 5, 3, 2, 3, 5, 2, 2, 4, 2, 6]
size = len(numbers)

path = []

def explore(pos):
    num = numbers[pos]

    print('explore', pos, num)

christian-oudard

import math
import shutil

# Braille bit order:
# 0 3
# 1 4
# 2 5
# 6 7

# bit: (x, y)

christian-oudard

Please publicly post the following Gist, and name it keybase.md

Keybase proof

I hereby claim:

• I am christian-oudard on github.
• I am christianoudard (https://keybase.io/christianoudard) on keybase.
• I have a public key ASDUW30p7kTHKwf_VGcYiMCC_iPMzpJVFihxm4EGJG3_Gwo