- Execute
pip3 install -r requirements.txt
to install dependencies - Execute
followers_clear.py
and follow instructions.
Consumer keys can be found here. Use these keys instead of applying yourself can get rid of rate limit.
pip3 install -r requirements.txt
to install dependenciesfollowers_clear.py
and follow instructions.Consumer keys can be found here. Use these keys instead of applying yourself can get rid of rate limit.
const I = x => x | |
const K = x => y => x | |
const A = f => x => f (x) | |
const T = x => f => f (x) | |
const W = f => x => f (x) (x) | |
const C = f => y => x => f (x) (y) | |
const B = f => g => x => f (g (x)) | |
const S = f => g => x => f (x) (g (x)) | |
const S_ = f => g => x => f (g (x)) (x) | |
const S2 = f => g => h => x => f (g (x)) (h (x)) |
{ | |
"hacfun":[ | |
"|∀゚", | |
"(´゚Д゚`)", | |
"(;´Д`)", | |
"(`・ω・)", | |
"(=゚ω゚)=", | |
"| ω・´)", | |
"|-` )", | |
"|д` )", |
301 https://github.com/zxdrive/imouto.host |
//GAE app的主体 | |
package hello | |
import ( | |
"appengine" | |
"appengine/urlfetch" | |
"bytes" | |
"encoding/gob" | |
"io" |
# source : http://code.google.com/p/natvpn/source/browse/trunk/stun_server_list | |
# A list of available STUN server. | |
stun.l.google.com:19302 | |
stun1.l.google.com:19302 | |
stun2.l.google.com:19302 | |
stun3.l.google.com:19302 | |
stun4.l.google.com:19302 | |
stun01.sipphone.com | |
stun.ekiga.net |
/* | |
This code demonstrates how to use a Fast Fourier Transform | |
with audiolib.js. It pushes samples to an FFT and draws | |
the FFT spectrum on an HTML5 canvas. | |
Author: Mike Hodnick | |
MIT License | |
*/ |
[Obsidian] | |
definition-foreground = #678CB1 | |
error-foreground = #FF0000 | |
string-background = #293134 | |
keyword-foreground = #93C763 | |
normal-foreground = #E0E2E4 | |
comment-background = #293134 | |
hit-foreground = #E0E2E4 | |
builtin-background = #293134 | |
stdout-foreground = #678CB1 |
import Criterion | |
import Criterion.Main (defaultMain, bench) | |
-- Chris Forno 2008-09-03 | |
isPalindromeLastInit :: (Eq a) => [a] -> Bool | |
isPalindromeLastInit [] = False | |
isPalindromeLastInit (x:[]) = True | |
isPalindromeLastInit (x:y:[]) = x == y | |
isPalindromeLastInit (x:xs) = x == last xs && isPalindromeLastInit (init xs) |