Summer Camp: Fortran
Junior High School: Basic
College: Algol, Pascal, PL/I,
Summer Camp: Fortran
Junior High School: Basic
College: Algol, Pascal, PL/I,
I run Fedora and KDE. Tags: #linux #audio #pulseaudio #alsamixer.
If I reboot with the headphones plugged in, they are not detected. Fix:
https://superuser.com/questions/1047666/headphone-jack-stops-working-after-suspend-reboot
| #!/usr/bin/env cabal | |
| {- cabal: | |
| build-depends: base, base-prelude, containers, text | |
| -} | |
| -- Spelling Bee | |
| -- | |
| -- Install Haskell: https://www.haskell.org/ghcup/ | |
| -- | |
| -- This is a standalone Haskell script, assuming you have cabal installed. The |
| // ==UserScript== | |
| // @name hackage | |
| // @namespace https://github.com/instinctive/ | |
| // @description Reorganize package contents pages on Hackage. | |
| // @include /^https?://hackage\.haskell\.org/package/[^/]*$/ | |
| // ==/UserScript== | |
| (function() { | |
| function getStyleSmall(elt) { |
Additional undocumented steps needed:
flutter config --android-sdk <path to /Sdk/>flutter config --android-studio-dir <path to /Studio/>export ANDROID_HOME=<path to /Sdk/>export PATH=$ANDROID_HOME/platform-tools:$ANDROID_HOME/platform-tools:$PATHflutter doctorflutter doctor --accept-licensesExisting chess server protocols (UCI) do a lot of things we don't need. Hence this simpler protocol.
Your chess program will read and write lines of input and output.
Informally, the first input line will either be black or white,
indicating which side your program will play.
Here's an example function to determine whether a set is strongly connected with respect to an adjacency function, implemented with direct recursion:
connected :: Ord a => (a -> [a]) -> Set a -> Bool
connected f s =
go (take 1 $ Set.elems s) s
where
go _ s | Set.null s = True
go [] _ = False| black = '#4e4e4e'; | |
| red = '#d68787'; // red | |
| green = '#5f865f'; // green | |
| yellow = '#d8af5f'; // yellow | |
| blue = '#85add4'; // blue | |
| magenta = '#d7afaf'; // pink | |
| cyan = '#87afaf'; // cyan | |
| white = '#d0d0d0'; // light gray | |
| lightBlack = '#626262'; // medium gray | |
| lightRe |
In The Manhattan Project (TMP) boardgame, you may use any three of your workers to run this mine.
There are effectively six kinds of workers in TMP, the cross-product of three occupations: Laborers, Engineers, and Scientists, and two types of employment: Full Time Employee (FTE) and Contractor.
| -- boilerplate elided from gist | |
| docase :: Int -> IO () | |
| docase i = do | |
| printf "Case #%d: " i | |
| _ <- getLine | |
| ss <- words <$> getLine | |
| outimp putStrLn $ solve ss | |
| aside (x:_,_) = x |