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
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
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
During the process of solving programming questions, I found that a good solution is very important, which can help me better understand the questions
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 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)
UTLeetcoder and UTLeetcoder Github When I was studying CSC236 and CSC263, I found the website Leetcode and started to use Leetcode t
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 \
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
Tree: a graph are connected and acyclic Trees \iff minimally connected graph aka remove any edge will cause disconnect Trees \iff maximally acyclic gr