Added two extra stages, download and information at: https://blog.hellholestudios.club/archives/169 screenshot:

APPROXIMATE PROBLEM WARNING Graph There is a grid of size N*M. Each grid could be "#" or ".". You need to find the shortest path from (1,1) to (N,M) by walking on "." only. But you are NOT given the graph. You can only see the grids near you. That ……

「考える問題は簡単ですか」 Programming Detect You are given a directed graph G with N nodes and M edges. Each node has an operation, which could be "def sth" or "use sth". An array of nodes A is called Exceptional iff: - for each 1\leq i\leq |A|-1 ……

野兽成分更多的思考题 广西省人大音乐II 不支持audio！！ Electric Heritage Haniyasushin Keiki loves crafting. She has n kinds of items. The i-th kind of item has name name_i. She also has m recipes. The i-th recipe needs len_i of different kinds of di……

比以往更加黑暗的思考题 广西省人大音乐 不支持audio！！ Idolatrize World Haniyasushin Keiki loves crafting. She has n kinds of items. The i-th kind of item has name name_i. She also has m recipes. The i-th recipe needs len_i of different kinds of dif……

思考题 for grand contest Orange Boy(Monk.eyk.ing),Red girl(Mack.erel.pike) and their cat LGM(Legendary.Grand.Meow) are a happy family. But in fact, they are the heroes that is helping the world in silent. One day, the earth is under the attack……

思考题 about poems Is your love as confusing as the sun acquiesced? Once a Chinese poem said: There's sun in the east but rain in the west, Is your love as confusing as the sun acquiesced? Now you are given a undirected weighted graph G of N ……

思考题 for Hakurei Reimu Legacy of Lunatic Kingdom ZJS loves playing Touhou. In the famous STG game Touhou:Legacy of Lunatic Kingdom the game rules are defined as follows: The game consists of N "stages". Player start from Stage 1 and ends at Stage……

OGF - Cayley Formula Question Statement Prove # of trees on [n] = n^{n-2} Solution f:(1,2,3,...,n)\to(1,2,3,...,n) f(1)=1,f(n)=n Functional Digraph(directed graph) D V(D)=[n] 编者注：V为节点集合 (i,j)\in E(D) if f(i)=j 注：E为边集合 Example | ……

$\mathcal A$ is a collection of combinatorial objects. => $\mathcal A$ and $\mathcal B$ are combinatorically isomorphic if there exist a size-preserving bijection between $\mathcal A$ and $\mathcal B$ Q1 Prove that number of Dyck Paths D_{n-1} equa……