🍉
1, 2, 4, 8, 16, 32, 64, 128, 256
Block or Report
Block or report classAndrew
Report abuse
Contact GitHub support about this user’s behavior. Learn more about reporting abuse.
Report abusePinned Loading
-
-
-
scrabble.py
scrabble.py 1from collections import Counter
23# for K, M-length dictionary words, and an N-tile hand, you can expect a complexity of
4# O(KM * lg M) Assuming letter counting and comparing is done in O(n) time (it isn't but
5# it can be with the cost of lots of memory) There's a pretty large coefficient of 2^26 since
-
SPH Solver Using Gaussian Smoothing ...
SPH Solver Using Gaussian Smoothing Kernel 1#define BOOST_LOG_DYN_LINK 1
23#include <iostream>
4#include <boost/log/trivial.hpp>
5#include <SDL2/SDL.h>
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.