通过对生物体在不同复杂度任务中的表现进行系统性研究，揭示其推理和执行能力的根本局限性。
2025年6月9日大约 7 分钟
地铁换城
坐地铁走遍全国各大城市
字离破碎
基于汉字字形的 Wordle
Fogginess
大物实验不确定度计算器
Through a systematic study of biological agents' performance on tasks of varying complexity, we reveal the fundamental limitations of their reasoning and execution capabilities.
2025年6月9日大约 4 分钟
Codeforces Round 1008 (Div. 1) 部分题目的题解：
A. Gellyfish and Flaming Peony
B. Gellyfish and Camellia Japonica
C. Gellyfish and Eternal Violet
D. Gellyfish and Forget-Me-Not
A. Gellyfish and Flaming Peony
B. Gellyfish and Camellia Japonica
C. Gellyfish and Eternal Violet
D. Gellyfish and Forget-Me-Not
2025年6月4日大约 4 分钟
The 2nd Universal Cup Semifinals（UCup Semifinals）部分题目的题解：
A. Records in Chichén Itzá
C. Space Station
G. CNOI Knowledge
K. Game: Battle of Menjis
M. Puzzle: Summon
A. Records in Chichén Itzá
C. Space Station
G. CNOI Knowledge
K. Game: Battle of Menjis
M. Puzzle: Summon
2025年5月6日大约 3 分钟
ICPC 2024 杭州区域赛（Hangzhou Regional）部分题目的题解：
B. Barkeley III
E. Elevator II
F. Fuzzy Ranking
G. Gathering Mushrooms
H. Heavy-light Decomposition
I. Identify Chord
M. Make It Divisible
B. Barkeley III
E. Elevator II
F. Fuzzy Ranking
G. Gathering Mushrooms
H. Heavy-light Decomposition
I. Identify Chord
M. Make It Divisible
2025年4月6日大约 5 分钟
Codeforces Round 1008 (Div. 1) 部分题目的题解：
A. Breach of Faith
B. Finding OR Sum
C. Binary Subsequence Value Sum
D. Maximum Polygon
E. Another Folding Strip
A. Breach of Faith
B. Finding OR Sum
C. Binary Subsequence Value Sum
D. Maximum Polygon
E. Another Folding Strip
2025年3月18日大约 5 分钟
2025 华为数据通信高校程序设计竞赛训练营 Day 3 部分题目的题解：
A. Undercover
F. Competition
I. TianHe-IIA
K. Cards
A. Undercover
F. Competition
I. TianHe-IIA
K. Cards
2025年2月22日大约 3 分钟
ICPC 2024 西南欧区域赛（Southwestern European Regional / SWERC 2024）部分题解：
B. Divine Gifting
C. Phryctoria
E. Building the Fort
F. Yaxchilán Maze
J. Recovering the Tablet
K. Disk Covering
L. The Charioteer
B. Divine Gifting
C. Phryctoria
E. Building the Fort
F. Yaxchilán Maze
J. Recovering the Tablet
K. Disk Covering
L. The Charioteer
2025年2月19日大约 5 分钟
ICPC 2024 横滨区域赛（Yokohama Regional）部分题目的题解：
A. Ribbon on the Christmas Present
B. The Sparsest Number in Between
C. Omnes Viae Yokohamam Ducunt?
D. Tree Generators
E. E-Circuit Is Now on Sale!
F. The Farthest Point
G. Beyond the Former Explorer
I. Greatest of the Greatest Common Divisors
A. Ribbon on the Christmas Present
B. The Sparsest Number in Between
C. Omnes Viae Yokohamam Ducunt?
D. Tree Generators
E. E-Circuit Is Now on Sale!
F. The Farthest Point
G. Beyond the Former Explorer
I. Greatest of the Greatest Common Divisors
2025年2月19日大约 4 分钟
ICPC 2024 EC Final 部分题目的题解：
A. Hitoshizuku
E. Corrupted Scoreboard Log
F. Boolean Function Reconstruction
G. Collatz Conjecture
H. Staircase Museum
I. Color-Balanced Tree
K. Exploration Boundary
A. Hitoshizuku
E. Corrupted Scoreboard Log
F. Boolean Function Reconstruction
G. Collatz Conjecture
H. Staircase Museum
I. Color-Balanced Tree
K. Exploration Boundary
2025年1月26日大约 6 分钟