lakshayg

import cp.   % ::, all_different
import util. % transpose

write_sudoku(S) =>
  foreach (R in S)
    foreach (X in R)
      printf("%d ", X)
    end,
    printf("%n")
  end.

lakshayg

#include <assert.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

/// TicTacToe ==========================================================================================================
typedef char Player;
const Player EMPTY = ' ';

lakshayg

//
// A solution to the problem described in
// https://www.youtube.com/watch?v=_-AfhLQfb6w
//
// How many sets of 5, 5-letter words exist such
// that the set has 25 distinct characters?
//
// It takes ~8sec to run on my machine.
//
// Usage: ./a.out < words_alpha.txt

lakshayg

person(knight).
person(knave).

persons(List) :- maplist(person, List).

claim(knight, Stmt) :- Stmt.
claim(knave, Stmt) :- \+Stmt.

% A puzzle taken from https://dmackinnon1.github.io/knaves/
% You have met a group of 6 islanders. Their names are Justin, Samuel, Ira, Frank, Beatrix, and Pamela.

lakshayg

import Data.Char  (ord)
import Data.Maybe (isJust)

data CellValue = CellValue { index :: Int
                           , row   :: Int
                           , col   :: Int
                           , box   :: Int
                           , value :: Int
                           }

lakshayg

#include <queue>
#include <cassert>
#include <vector>
#include <iostream>

template <typename T>
class MedianAccumulator {
public:
  MedianAccumulator();
  void operator()(T val);

lakshayg

Keybase proof

I hereby claim:

• I am lakshayg on github.
• I am lakshayg (https://keybase.io/lakshayg) on keybase.
• I have a public key whose fingerprint is D0E4 D498 1ED1 012D 9B01 6DF7 4F87 0680 C2A5 1C37

To claim this, I am signing this object:

lakshayg

// This code has been migrated to https://github.com/lakshayg/erfinv