Gaelan

ChatGPT passes the 2022 AP Computer Science A free response section

For fun, I had ChatGPT take the free response section of the 2022 AP Computer Science A exam. (The exam also has a multiple-choice section, but the College Board doesn't publish this.) It scored 32/36.

Methodology

• For each question, I pasted in the full text of the question and took the response given.
• I tried each question once and took the response given: no cherry-picking. For readability, I've added indentation in some cases, and included method signatures where they were provided in the question and ChatGPT only provided a body. I've added question numbers; any other comments are ChatGPT's.
• Many questions have examples containing tables or diagrams; because those don't translate well to plain text, I excluded those tables/diagrams and any text that referenced them.
• I excluded the initial instructions at the top of th

jeeger

#!/usr/bin/env bb
(ns bookstats
  (:require [babashka.pods :as pods]
            [clojure.pprint :as pprint]))
(pods/load-pod 'org.babashka/go-sqlite3 "0.1.0")
(pods/load-pod 'retrogradeorbit/bootleg "0.1.9")
(require '[pod.babashka.go-sqlite3 :as sqlite]
         '[pod.retrogradeorbit.hickory.select :as s]
         '[pod.retrogradeorbit.bootleg.utils :as utils])
(import [java.net URLEncoder]

ssrihari

An opinionated list of excellent Clojure learning materials

These resources (articles, books, and videos) are useful when you're starting to learn the language, or when you're learning a specific part of the language. This an opinionated list, no doubt. I've compiled this list from writing and teaching Clojure over the last 10 years.

• 🔴 Mandatory (for both beginners and intermediates)
• 🟩 For beginners
• 🟨 For intermediates

Table of contents

1. Getting into the language

borkdude

(ns aoc21-01
  (:require [clojure.string :as str]))

(def input (map parse-long (str/split-lines (slurp "input.txt"))))

(defn answer-01 [input]
  (count (filter true? (map < input (rest input)))))

(def three-sliding-window
  (map + input (next input) (nnext input)))

shawwn

Twitter thread: https://twitter.com/theshawwn/status/1456925974919004165
Hacker News thread: https://news.ycombinator.com/item?id=29128998

November 6, 2021

How does JAX allocate memory on a TPU?

jnp.device_put(1) is deceptively simple to write in JAX. But on a TPU, what actually happens? How does a tensor containing the value 1 actually get onto a TPU?

Turns out, the answer is "C++", and a lot of it.

marcan

#!/usr/bin/python3
# Solution to the challenge at https://gist.github.com/ehmo/7f515ac6461c1c4d3e5a74f12e6eb5ea
# Sample solution: https://twitter.com/marcan42/status/1428933147660492800
#
# Given an input base image, computes two derivative images that have different
# perceptual hashes, yet differ by only one pixel.
#
# Usage: hash_bisector.py <input.png> <output_a.png> <output_b.png>
#
# Licensed under the terms of the STRONGEST PUBLIC LICENSE, Draft 1:

chrispsn

WAR ON RAZE

This is the story of what happened when I went down a rabbit hole.

It starts with k7. If you press Ctrl-] in the k7 WASM console, this appears:

x^x*/:x:2_!100

That's a prime number filter. There are faster ones - kparc.com's x,1_&&/80#'!:'x is beautiful - but this one is really short.

levelsio

<?

	//
	// AUTO KEYWORD-BASED FOLLOWER CURATION BOT (by @levelsio)
	//
	// File: twitterFollowerCuratorBot.php
	//
	// Created: May 2021
	// License: MIT
	//

searls

let audioContext
export function play (url) {
  const AudioContext = window.AudioContext || window.webkitAudioContext
  if (!audioContext) audioContext = new AudioContext()
  const request = new window.XMLHttpRequest()
  request.open('GET', url, true)
  request.responseType = 'arraybuffer'
  request.addEventListener('load', function (e) {
    const source = audioContext.createBufferSource()
    source.buffer = audioContext.createBuffer(request.response, false)

llelf

   what               k4/k7         k9              example    result                
  ---------------------------------------------------------------------------------
   each-left         a f\:b     a f\:b            (!3)*\:!2    (0 0;0 1;0 2)         
   each-right        a f/:b     a f/:b            (!3)*/:!2    (0 0 0;0 1 2)         
   fold                 f/v        f/v                */6 7    42                    
   fold w/initial     a f/v      a f/v             7*/11 13    1001                  
   scan                 f\v        f\v              -\1 1 1    1 0 -1                
   scan w/initial     a f\v      a f\v             3-\1 1 1    2 1 0