Yorafa
Use poste.io + nginx proxy manager to build a mail server, with solutions for LE challenge fail
Install poste.io First, make sure you have installed docker. If not, you can refer to article It is personally recommended to use docker compose for d
Use docker + Fast Reverse Proxy + Nginx Proxy Manager to turn an old computer into a new server
Everyone has more or less the need to access their own home devices when they are outside, but it is time-consuming and laborious to configure the hom
Use PyAutoGUI to play Two Turn Puzzle
I've been playing sumikko farm recently, and it has an activity related to the two turn puzzle. The details are as follows: The rules of the game are
How I contributed LC-Rating
During the process of solving programming questions, I found that a good solution is very important, which can help me better understand the questions
Introduce to Fast Power
Forx^n, write its power in binary formatn = \sum_{i = 0}^{k} = a_i2^i, and getx^n = \prod_{i = 0}^k x^{a_i2^i} It is not difficult to get that when i
Time Complexity Lookup
Time complexity requirements for some algorithm competitions n\le 10 \iff \mathcal{O}(n!) n\le 15 \iff \mathcal{O}(3^n) n\le 25 \iff \mathcal{O}(2^n)
How I created UTLeetcoder
UTLeetcoder and UTLeetcoder Github When I was studying CSC236 and CSC263, I found the website Leetcode and started to use Leetcode t
Recurrence & Correctness
Recurrence A recurrence is in standard form if it is written as T(n) = aT(n/b) + f(n). For some constants a\ge 1, b > 1, and some function f: \N \to \
What is a Graph?
A graph G= (V, E) is a pair of sets (V, E) where V is a set of vertices andE is a set of edges. Graph Properties If E is a set of unordered pairs, the
What is a Tree? Forest?
Tree: a graph are connected and acyclic Trees \iff minimally connected graph aka remove any edge will cause disconnect Trees \iff maximally acyclic gr
Algorithm Time Complexity Analysis
For function f: f= O(g) (Big-O) means that \exists k \in \R_{0},(\exists n_0 \in \N(\forall n\in \N. (n > n_0\implies f(n)\le kg(n)))) we can use big-
Introduce to Shell Programming
Shell is a program that infinite looped to execute and interpreter command. It likes: id1([Print Prompt]) -> id2([Read a Command]) -> id3([Parse Comma
Bitwise Operations
Most programming languages support the following bitwise operations (note that the following numbers are all in binary): Symbol Description <
Use Format I/O in C/C++
The "I/O" standards input and output, and they usually refer to system stdin and stdout . Format For convenience reason, we want to quick read/write v
SSH Connection Configuration
SSH Key Generate Configure ssh for password-free quick connection. First check the ~/.ssh/ folder on the local. If you have not generated id_rsa relat