EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
| Problems | AC |
|---|---|
| A. Upload More RAM | ○ |
| B. K-Sort | ○ |
| C. Basil’s Garden | ○ |
| D. World is Mine | ○ |
| E. Wonderful Tree! | ○ |
| F1. Interesting Problem (Easy Version) | ⊕ |
| F2. Interesting Problem (Hard Version) | ⊕ |
| G1. Spinning Round (Easy Version) | |
| G2. Spinning Round (Hard Version) | |
| H. Fumo Temple |
Codeforces Round 955 (Div. 2, with prizes from NEAR!)
重生之我是 Jumping
| Problems | AC |
|---|---|
| A. Soccer | ○ |
| B. Collatz Conjecture | ○ |
| C. Boring Day | ○ |
| D. Beauty of the mountains | ○ |
| E. Number of k-good subarrays | ⊕ |
| F. Sorting Problem Again | ⊕ |
发现自己的小号已经 unrated for div3 了
这什么神笔场，F 不会求割边和点双被卡科技了，G1 G2 赛时想出正解但是以为自己的复杂度是错的就没写。。。
| Problems | AC |
|---|---|
| A. X Axis | ○ |
| B. Matrix Stabilization | ○ |
| C. Update Queries | ○ |
| D. Mathematical Problem | ○ |
| E. Beautiful Array | ○ |
| F. Non-academic Problem | ⊕ |
| G1. Permutation Problem (Simple Version) | ⊕ |
| G2. Permutation Problem (Hard Version) | ⊕ |
VP Date 2024/5/17
2024 ICPC National Invitational Collegiate Programming Contest, Wuhan Site
| Problems | AC |
|---|---|
| A. Shaking Trees | |
| B. Countless Me | ○ |
| C. TreeBag and LIS | |
| D. ICPC | ⊕ |
| E. Boomerang | ⊕ |
| F. Custom-Made Clothes | ○ |
| G. Pack | |
| H. Wings of Crystals | |
| I. Cyclic Apple Strings | ○ |
| J. Gensokyo Autobahn | |
| K. Party Games | ○ |
| L. Magic Fairies | |
| M. Merge | ⊕ |
| Problems | AC |
|---|---|
| A. Alice and Books | ○ |
| B. New Bakery | ○ |
| C. Manhattan Permutations | ○ |
| D. Elections | ○ |
| E. Computing Machine | ⊕ |
| F. Large Graph | ⊕ |
赛后一个题一个题做的
| Problems | AC |
|---|---|
| A. Creating Words | ○ |
| B. Maximum Multiple Sum | ○ |
| C. Good Prefixes | ○ |
| D. Manhattan Circle | ○ |
| E. Secret Box | ○ |
| F. Final Boss | ○ |
| G. D-Function | ○ |
| H1. Maximize the Largest Component (Easy Version) | ○ |
| H2. Maximize the Largest Component (Hard Version) | ○ |
| Problems | AC |
|---|---|
| A. Strange Splitting | ○ |
| B. Large Addition | ○ |
| C1. Magnitude (Easy Version) | ○ |
| C2. Magnitude (Hard Version) | ○ |
| D. ‘’a’’ String Problem | ○ |
| E. Shuffle | |
| F. Reconstruction |
SVD，全称为奇异值分解（Singular Value Decomposition），是一种在数值线性代数中广泛使用的矩阵分解技术。SVD 将一个矩阵分解成三个特定的矩阵的乘积，可以用于许多应用领域，包括信号处理、统计分析、图像处理和推荐系统等。
| Problems | AC |
|---|---|
| A. Guess the Maximum | ○ |
| B. XOR Sequences | ○ |
| C. Earning on Bets | ○ |
| D. Fixing a Binary String | ○ |
| E. Manhattan Triangle | ○ |
| F. Kostyanych’s Theorem |
Stanford CS231n: Deep Learning for Computer Vision