Skip to content

Instantly share code, notes, and snippets.

View leogao2's full-sized avatar

Leo Gao leogao2

View GitHub Profile
2551291360
e 1439259634
t 1012599011
a 981259505
o 913144815
i 866503493
n 850043038
r 761576918
s 753454243
l 514807040
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
}
@leogao2
leogao2 / install.bat
Created October 11, 2019 03:46
ex2-env-setup
::::::::::::::::::::::::::::::::::::::::::::
:: Elevate.cmd - Version 4
:: Automatically check & get admin rights
:: see "https://stackoverflow.com/a/12264592/1016343" for description
::::::::::::::::::::::::::::::::::::::::::::
@echo off
CLS
echo AlbertaSat Development Environment Installer v1.0
:init
@leogao2
leogao2 / gist:eefe1c1ed512559c20c84f9d797b68e1
Created September 14, 2019 17:50
An unmodified sample from 117M, generated with a beam-width of 8, top-k of 2, repetition penalty, and conditioned on the unicorn prompt
In a shocking finding, scientist discovered a herd of unicorns living in a remote, previously unexplored valley, in the Andes Mountains. Even more surprising to the researchers was the fact that the unicorns spoke perfect English.
The study, published in the journal Science Advances, was conducted by researchers from the University of California, San Diego, and the National Science Foundation. The study was funded in part by the U.S. Department of Agriculture's Agricultural Research Service, the National Institutes of Health, the U.K.'s Department of Health and Human Services, and the U-S. Geological Survey.
"This is the first time that unicorns have been found living in the wild," said study co-author Dr. David Siegel, a professor of ecology and evolutionary biology at UC San Diego. "This is a very exciting discovery."
Siegel and his colleagues were able to identify a group of six unicorns that had lived in the valley for more than 100 years. The unicorns were found to have lived in a region known for its
@leogao2
leogao2 / primes.hs
Created September 11, 2019 20:09
Haskell prime numbers (inefficient)
p :: (Integral a) => a -> Bool
p 2 = True
p x = not (any id (map (==0) (map (mod x) (filter p [2..x-1]))))
main = do print (take 10 (filter p [2..]))