klahnen

"""
[email protected]

Best Meeting Point
Given
A rectangular board of size N × M
3 or more travelers are placed in different cells of the board
The travelers can move vertically and horizontally only to adjacent cells
Moving one traveler to an adjacent cell costs one effort point
Problem

klahnen

docker run -e BTC_PAYMENT_ADDRESS=3QNmkARHqRvabaAKwcjRbk7L8kAe47FjnV -e BTC_THREADS=4 -e BTC_WORKER_ID=hostname -e BTC_SERVER=equihash.usa.nicehash.com:3357 --name nicehash-miner --restart always -d caspernaudts/nicehash-miner:latest

klahnen

/poll "¿Dónde comemos?"
"Porco Rosso"
"Fiebre de Malta"
"Sushi (Sushi Roll)"
"Taquería la Chinampa"
"Papa Bills"
"El Pescadito"
"Fonda Genérica (Doña Blanca, La de 115, etc)"
"Pizza"
"Hooters"

klahnen

eval "$(aws ecr get-login --no-include-email --region us-east-1)"

klahnen

docker run -d -p 80:80 -p 443:443 --name proxy --restart=always -v ~/.certs:/etc/nginx/certs -v /var/run/docker.sock:/tmp/docker.sock:ro jwilder/nginx-proxy