Codeforces Round 1008 (Div. 2)
Problems | AC | Note |
---|---|---|
A. Final Verdict | ○ | |
B. Vicious Labyrinth | ○ | |
C. Breach of Faith | ○ | |
D. Scammy Game Ad | ○ | |
E. Finding OR Sum | ⊕ | |
F. Binary Subsequence Value Sum | ○ | |
G. Another Folding Strip |
Codeforces Round 1008 (Div. 2)
Problems | AC | Note |
---|---|---|
A. Final Verdict | ○ | |
B. Vicious Labyrinth | ○ | |
C. Breach of Faith | ○ | |
D. Scammy Game Ad | ○ | |
E. Finding OR Sum | ⊕ | |
F. Binary Subsequence Value Sum | ○ | |
G. Another Folding Strip |
2024-2025 ICPC Northwestern European Regional Programming Contest (NWERC 2024)
Problems | Status | Notes |
---|---|---|
A. Alphabetical Aristocrats | ○ | |
B. Binary Search | ||
C. Connect Five | ||
D. Dutch Democracy | ○ | |
E. Evolving Etymology | ||
F. Flowing Fountain | ||
G. Glued Grid | ||
H. Hash Collision | ○ | |
I. It’s a Kind of Magic | ||
J. Jib Job | ○ | |
K. Kruidnoten | ⊕ | |
L. Limited Library | ○ | |
M. Mouse Trap |
Problems | AC | Note |
---|---|---|
A. MEX Table | ○ | |
B. Gorilla and the Exam | ○ | |
C. Trip to the Olympiad | ○ | |
D. Gifts Order | ○ | 线段树 |
E1. Another Exercise on Graphs (Easy Version) | ⊕ | 二分 |
E2. Another Exercise on Graphs (hard version) | ⊕ | 并查集 |
F. Formation | ||
G. Secret Message | ||
H. Coffee Break |
Problems | AC | Note |
---|---|---|
A. Tender Carpenter | ○ | |
B. Outstanding Impressionist | ○ | |
C. Bewitching Stargazer | ○ | |
D. Refined Product Optimality | ⊕ | 交换 |
E. Resourceful Caterpillar Sequence | ⊕ | game、树上计数 |
F. Earnest Matrix Complement | ||
G. Naive String Splits | ||
H. Delicate Anti-monotonous Operations | ||
I1. Affectionate Arrays (Easy Version) | ||
I2. Affectionate Arrays (Hard Version) |
Problems | AC | Note |
---|---|---|
A. MEX Destruction | ○ | |
B. pspspsps | ○ | |
C. MEX Cycle | ○ | 构造 |
D. Shift + Esc | ○ | DP |
E. Broken Queries | ⊕ | 交互、二分 |
F. MEX OR Mania | ⊕ | 启发式合并 |
Problems | AC | Note |
---|---|---|
A. Kevin and Combination Lock | ○ | |
B. Kevin and Permutation | ○ | |
C. Kevin and Binary Strings | ○ | |
D. Kevin and Competition Memories | ○ | |
E. Kevin and Bipartite Graph | ⊕ | 二分图、构造 |
F. Kevin and Math Class | ⊕ | 笛卡尔树、树形 DP |
G. Kevin and Matrices | ||
H. Kevin and Strange Operation | ||
I1. Kevin and Puzzle (Easy Version) | ||
I2. Kevin and Puzzle (Hard Version) |
2024 China Collegiate Programming Contest (CCPC) Female Onsite (2024年中国大学生程序设计竞赛女生专场)
Problems | AC | Note |
---|---|---|
A. Box | ○ | 签到 |
B. Aho-Corasick Automaton | ||
C. CCPC | ○ | 签到 |
D. Excellent Splitting | ||
E. Centroid Tree | ○ | 并查集 |
F. Perfect Square | ⊕ | 数学、背包 |
G. Increasing Sequence | ○ | 拆数位 |
H. Square Root | ○ | 签到 |
I. String Duplication | ⊕ | SAM |
J. Sum of Squares of GCDs | ||
K. Xiao Kai’s Dream of Provincial Scholarship | 模拟 | |
L. Puzzle | ○ | 思维 |
M. Covering a Tree | ○ | 贪心 |
Problems | AC |
---|---|
A. Game of Division | ○ |
B. Paint a Strip | ○ |
C. Ordered Permutations | ○ |
D. Non Prime Tree | ⊕ |
E. Control of Randomness | ⊕ |
F. Number of Cubes |
Codeforces Round 989 (Div. 1 + Div. 2)
构造 Round
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
Problems | AC |
---|---|
A. King Keykhosrow’s Mystery | ○ |
B. Rakhsh’s Revival | ○ |
C. Trapped in the Witch’s Labyrinth | ○ |
D. Darius’ Wisdom | ⊕ |
E. Permutations Harmony | ⊕ |
F1. Khayyam’s Royal Decree (Easy Version) | |
F2. Khayyam’s Royal Decree (Hard Version) | |
G1. Simurgh’s Watch (Easy Version) | |
G2. Simurgh’s Watch (Hard Version) | |
H. Rayan vs. Rayaneh |
Educational Codeforces Round 171 (Rated for Div. 2)
Problems | AC |
---|---|
A. Perpendicular Segments | ○ |
B. Black Cells | ○ |
C. Action Figures | ○ |
D. Sums of Segments | ○ |
E. Best Subsequence | ○ |
F. Bermart Ice Cream |