摘要：
题目链接 Problem Description 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Ch 阅读全文
摘要：
D. Bicolorings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a grid, con 阅读全文
摘要：
题目链接 Problem Description You are playing CSGO. There are n Main Weapons and m Secondary Weapons in CSGO. You can only choose one Main Weapon and one S 阅读全文
摘要：
题目链接 Problem Description Multiple query, for each n, you need to get $$$$$$ \sum_{i=1}^{n} \sum_{j=1}^{i-1}{ [gcd(i + j, i - j) = 1]} $$$$$$ Input On 阅读全文
摘要：
E. Inverse Coloring time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a squa 阅读全文
摘要：
题目链接 Problem Description Nash Equilibrium is an important concept in game theory. Rikka and Yuta are playing a simple matrix game. At the beginning of 阅读全文
摘要：
D. Array Restoration time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Initially there was 阅读全文
摘要：
题目链接 Problem Description There is an apple tree in front of Taotao's house. When autumn comes, n apples on the tree ripen, and Taotao will go to pick 阅读全文
摘要：
题目链接 Problem Description A parentheses matrix is a matrix where every element is either '(' or ')'. We define the goodness of a parentheses matrix as 阅读全文
摘要：
题目链接 Problem Description 度度熊正在学习双端队列，他对其翻转和合并产生了很大的兴趣。 初始时有 N 个空的双端队列（编号为 1 到 N ），你要支持度度熊的 Q 次操作。 ①1 u w val 在编号为 u 的队列里加入一个权值为 val 的元素。（w=0 表示加在最前面，w 阅读全文