San Song Daddy :)

Assume you have a ghost server ran at a host machine. Oneday the host machine maybe out of space or you find a new cheap host, or you have a new host that have power memory and performance. Then you may need to transfer your ghost server to another new host. tar your ghost server to a *.tar.gz //blog is my ghost server root directory $cd www/blog $tar -zcvf blog.tar.gz blog copy the blog.tar.gz to the new host preinstall on new host nginx sudo apt-get install nginx node.js https://nodejs.org/en/download/ extract and add node bin path to env ghost npm i -g ghost-cli acme.sh https://github.com/Neilpang/acme.sh configure on new host tar cvf blog.tar.gz nginx conf sudo ln -sf blog/system/files/blog.conf /etc/nginx/sites-available/blog.conf sudo ln -sf /etc/nginx/sites-available/blog.conf /etc/nginx/sites-enabled/blog.conf start http server ghost start if you encounter systemd error, just follow the hint command(ghost linuxuser systemd) by ghost and run ghost

install sudo apt-get install software-properties-common -y sudo add-apt-repository ppa:max-c-lv/shadowsocks-libev -y sudo apt-get update sudo apt install shadowsocks-libev configure sudo vim /etc/shadowsocks-libev/config.json { "server":"10.128.0.2", "server_port":8911, "local_port":1008, "password":"jesusislove", "timeout":60, "method":"chacha20-ietf-poly1305" } start server sudo systemctl start shadowsocks-libev google compute engine If the server are running on a google compute engine, You need to setup a firewall rules for the server port(8911, written in config.json). shadowsocks Apply to all IP ranges: 0.0.0.0/0 tcp:8911, udp:8911 Allow client configuration iOS Android Shadowsocks for Android / iOS also accepts BASE64 encoded URI format configs: ss://BASE64-ENCODED-STRING-WITHOUT-PADDING#TAG Where the plain URI should be: ss://method:passwo

利未记五7、11 7「他的力量若不够献一只羊羔，就要因所犯的罪，把两只斑鸠或是两只雏鸽带到耶和华面前为赎愆祭：一只作赎罪祭，一只作燔祭。 11「他的力量若不够献两只斑鸠或是两只雏鸽，就要因所犯的罪带供物来，就是细面伊法十分之一为赎罪祭；不可加上油，也不可加上乳香，因为是赎罪祭。 Photo by Brooke Lark / Unsplash

Express helper, res.download Express has a helper for this: app.get('/xxx', function(req, res){  var file = __dirname + '/xxx';  res.download(file); // Set disposition and send it.  }); http file download header https://developer.mozilla.org/en-US/docs/Web/HTTP/Headers/Content-Disposition res.setHeader('Content-disposition', 'attachment; filename=xxx');

command sudo iptables -P INPUT ACCEPT sudo iptables -F list all rules sudo iptables -L Chain INPUT (policy ACCEPT) target prot opt source destination Chain FORWARD (policy DROP) target prot opt source destination Chain OUTPUT (policy ACCEPT) target prot opt source destination

Form-based File Upload in HTML https://tools.ietf.org/html/rfc1867 Express Fast, unopinionated, minimalist web framework for node. Multer Multer is a node.js middleware for handling multipart/form-data, which is primarily used for uploading files. It is written on top of busboy for maximum efficiency. NOTE: Multer will not process any form which is not multipart (multipart/form-data). Client Codes(index.html) <script type="text/javascript"> function upload(postUrl, fieldName, files) { var formData = new FormData(); formData.append(fieldName, files); var req = new XMLHttpRequest(); req.open("POST", postUrl); req.onload = function(event) { console.log(event.target.responseText); }; req.send(formData); } function onchange() { for (let i = 0; i < this.files.length; i++) { upload('/uploads', 'uploadfile', this.files[i]); } } window.onload = function () { var input = document.getElementById('file'); inpu

"C" is for "combination". A combination is an un-ordered collection of distinct elements, usually of a prescribed size and taken from a given set. C(n, r) = n!/[r!(n-r)!]    #include <stdio.h> #include <sys/time.h> int a[1001]; // selected n numbers stored in array a // a[1], a[2], ... , a[n] // a[i+1] > a[i] // a[i] - i <= m - n + 1 void comos(int n, int m) { int i,j; if (n > m) return; for (i = 1; i <= n; i++) { a[i] = i; } int cur = n; do { if (a[cur]-cur <= m - n) { for (i = 1; i <= n; i++) printf("%d ", a[i]); printf("\n"); a[cur]++; continue; } else { if (cur == 1) { break; } a[--cur]++; for (i = 1; i <= (n-cur); i++) a[cur+i] = a[cur] + i; if (a[cur] - cur < m - n + 1) cur=n; } } while(1); } int main() { int N, M; while (scanf("%d %d", &N, &M) != EOF) {