|
|
13884 |
luoguP9559
[SDCPC 2023] Fast and Fat
|
0 / 0 |
5 |
|
|
13885 |
luoguP9560
[SDCPC 2023] Math Problem
|
0 / 0 |
6 |
|
|
13886 |
luoguP9561
[SDCPC 2023] Colorful Segments
|
0 / 0 |
7 |
|
|
13893 |
luoguP9562
[SDCPC 2023] Matching
|
0 / 0 |
5 |
|
|
13900 |
luoguP9563
[SDCPC 2023] Be Careful 2
|
0 / 0 |
9 |
|
|
13901 |
luoguP9564
[SDCPC 2023] Three Dice
|
0 / 0 |
1 |
|
|
13905 |
luoguP9565
[SDCPC 2023] Not Another Path Query Problem
|
0 / 0 |
6 |
|
|
13902 |
luoguP9566
[SDCPC 2023] Difficult Constructive Problem
|
0 / 0 |
7 |
|
|
13906 |
luoguP9567
[SDCPC 2023] Puzzle: Sashigane
|
0 / 0 |
5 |
|
|
13907 |
luoguP9568
[SDCPC 2023] Computational Geometry
|
0 / 0 |
7 |
|
|
13220 |
luoguP9575
「TAOI-2」喵了个喵 Ⅳ
|
0 / 0 |
7 |
|
|
13967 |
luoguP9600
[IOI 2023] 封锁时刻
|
0 / 0 |
8 |
|
|
13970 |
luoguP9601
[IOI 2023] 最长路程
|
0 / 0 |
9 |
|
|
13968 |
luoguP9602
[IOI 2023] 足球场
|
0 / 0 |
9 |
|
|
13969 |
luoguP9603
[IOI 2023] 山毛榉树
|
0 / 0 |
9 |
|
|
13973 |
luoguP9604
[IOI 2023] 超车
|
0 / 0 |
8 |
|
|
13975 |
luoguP9605
[IOI 2023] 机器人比赛
|
0 / 0 |
9 |
|
|
13887 |
luoguP9690
[GDCPC 2023] Programming Contest
|
0 / 0 |
1 |
|
|
13888 |
luoguP9691
[GDCPC 2023] Base Station Construction
|
0 / 0 |
6 |
|
|
13889 |
luoguP9692
[GDCPC 2023] Trading
|
0 / 0 |
3 |
|
|
13890 |
luoguP9693
[GDCPC 2023] New Houses
|
0 / 0 |
5 |
|
|
13891 |
luoguP9694
[GDCPC 2023] New but Nostalgic Problem
|
0 / 0 |
7 |
|
|
13892 |
luoguP9695
[GDCPC 2023] Traveling in Cells
|
0 / 0 |
7 |
|
|
13894 |
luoguP9696
[GDCPC 2023] Swapping Operation
|
0 / 0 |
8 |
|
|
13895 |
luoguP9697
[GDCPC 2023] Canvas
|
0 / 0 |
8 |
|
|
13896 |
luoguP9698
[GDCPC 2023] Path Planning
|
0 / 0 |
5 |
|
|
13897 |
luoguP9699
[GDCPC 2023] X Equals Y
|
0 / 0 |
7 |
|
|
13898 |
luoguP9700
[GDCPC 2023] Peg Solitaire
|
0 / 0 |
5 |
|
|
13899 |
luoguP9701
[GDCPC 2023] Classic Problem
|
0 / 0 |
8 |
|
|
13903 |
luoguP9702
[GDCPC 2023] Computational Geometry
|
0 / 0 |
7 |
|
|
14003 |
luoguP9730
[CEOI 2023] Grading Server
|
0 / 0 |
9 |
|
|
14008 |
luoguP9731
[CEOI 2023] Balance
|
0 / 0 |
8 |
|
|
14002 |
luoguP9732
[CEOI 2023] Trade
|
0 / 0 |
9 |
|
|
14001 |
luoguP9733
[CEOI 2023] The Ties That Guide Us (incursion)
|
0 / 0 |
8 |
|
|
13872 |
luoguP9740
「KDOI-06-J」ION 比赛
|
0 / 0 |
1 |
|
|
12780 |
luoguP9741
「KDOI-06-J」翻转与反转
|
0 / 0 |
3 |
|
|
13915 |
luoguP9742
「KDOI-06-J」贡献系统
|
0 / 0 |
6 |
|
|
14035 |
luoguP9743
「KDOI-06-J」旅行
|
0 / 0 |
6 |
|
|
13030 |
luoguP9744
「KDOI-06-S」消除序列
|
0 / 0 |
6 |
|
|
14036 |
luoguP9745
「KDOI-06-S」树上异或
|
0 / 0 |
7 |
|
|
13717 |
luoguP9746
「KDOI-06-S」合并序列
|
0 / 0 |
8 |
|
|
13364 |
luoguP9747
「KDOI-06-S」签到题
|
0 / 0 |
8 |
|
|
14098 |
luoguP9748
[CSP-J 2023] 小苹果
|
1 / 1 |
3 |
|
|
14099 |
luoguP9749
[CSP-J 2023] 公路
|
1 / 1 |
3 |
|
|
14100 |
luoguP9750
[CSP-J 2023] 一元二次方程
|
4 / 1 |
5 |
|
|
14101 |
luoguP9751
[CSP-J 2023] 旅游巴士
|
1 / 1 |
6 |
|
|
14102 |
luoguP9752
[CSP-S 2023] 密码锁
|
0 / 0 |
3 |
|
|
14103 |
luoguP9753
[CSP-S 2023] 消消乐
|
0 / 0 |
7 |
|
|
14104 |
luoguP9754
[CSP-S 2023] 结构体
|
0 / 0 |
7 |
|
|
14105 |
luoguP9755
[CSP-S 2023] 种树
|
0 / 0 |
7 |
|
|
14070 |
luoguP9769
[HUSTFC 2023] 简单的加法乘法计算题
|
0 / 0 |
5 |
|
|
14077 |
luoguP9770
[HUSTFC 2023] 逆 KMP
|
0 / 0 |
8 |
|
|
14081 |
luoguP9771
[HUSTFC 2023] 排列排序问题
|
0 / 0 |
3 |
|
|
14076 |
luoguP9772
[HUSTFC 2023] 网格染色
|
0 / 0 |
5 |
|
|
14094 |
luoguP9773
[HUSTFC 2023] 序列配对
|
0 / 0 |
8 |
|
|
14078 |
luoguP9774
[HUSTFC 2023] 新取模运算
|
0 / 0 |
6 |
|
|
14079 |
luoguP9775
[HUSTFC 2023] 广义线段树
|
0 / 0 |
7 |
|
|
14080 |
luoguP9776
[HUSTFC 2023] 狭义线段树
|
0 / 0 |
8 |
|
|
14074 |
luoguP9777
[HUSTFC 2023] Fujisaki 讨厌数学
|
0 / 0 |
6 |
|
|
14075 |
luoguP9778
[HUSTFC 2023] 基因编辑
|
0 / 0 |
7 |
|
|
14073 |
luoguP9779
[HUSTFC 2023] 不定项选择题
|
0 / 0 |
1 |
|
|
14072 |
luoguP9780
[HUSTFC 2023] Azur Lane
|
0 / 0 |
5 |
|
|
14095 |
luoguP9781
[HUSTFC 2023] 近似递增序列
|
0 / 0 |
8 |
|
|
14071 |
luoguP9782
[HUSTFC 2023] A+B problem
|
0 / 0 |
1 |
|
|
14089 |
luoguP9804
[POI 2022/2023 R1] kol
|
0 / 0 |
6 |
|
|
14090 |
luoguP9805
[POI 2022/2023 R1] ply
|
0 / 0 |
5 |
|
|
14091 |
luoguP9806
[POI 2022/2023 R1] poc
|
0 / 0 |
5 |
|
|
14092 |
luoguP9807
[POI 2022/2023 R1] wyp
|
0 / 0 |
8 |
|
|
14093 |
luoguP9808
[POI 2022/2023 R1] zbo
|
0 / 0 |
8 |
|
|
14189 |
luoguP9853
[入门赛 #17] 方程求解
|
0 / 0 |
3 |
|
|
14087 |
luoguP9868
[NOIP2023] 词典
|
0 / 0 |
3 |
|
|
14086 |
luoguP9869
[NOIP2023] 三值逻辑
|
0 / 0 |
6 |
|
|
14221 |
luoguP9870
[NOIP2023] 双序列拓展
|
0 / 0 |
8 |
|
|
14222 |
luoguP9871
[NOIP2023] 天天爱打卡
|
0 / 0 |
8 |
|
|
14224 |
luoguP9903
[COCI 2023/2024 #1] Sudoku
|
0 / 0 |
3 |
|
|
14225 |
luoguP9904
[COCI 2023/2024 #1] Labirint
|
0 / 0 |
6 |
|
|
14255 |
luoguP9905
[COCI 2023/2024 #1] AN2DL
|
0 / 0 |
6 |
|
|
14256 |
luoguP9906
[COCI 2023/2024 #1] Kocke
|
0 / 0 |
7 |
|
|
14257 |
luoguP9907
[COCI 2023/2024 #1] Mostovi
|
0 / 0 |
9 |
|
|
14299 |
luoguP9908
[COCI 2023/2024 #2] Pahuljice
|
0 / 0 |
3 |
|
|
14300 |
luoguP9909
[COCI 2023/2024 #2] Pingvin
|
0 / 0 |
3 |
|
|
14301 |
luoguP9910
[COCI 2023/2024 #2] Dizalo
|
0 / 0 |
8 |
|
|
14302 |
luoguP9911
[COCI 2023/2024 #2] Kuglice
|
0 / 0 |
6 |
|
|
14303 |
luoguP9912
[COCI 2023/2024 #2] Zatopljenje
|
0 / 0 |
6 |
|
|
14248 |
luoguP9921
[POI 2023/2024 R1] Budowa lotniska
|
0 / 0 |
7 |
|
|
14249 |
luoguP9922
[POI 2023/2024 R1] CzatBBB
|
0 / 0 |
8 |
|
|
14250 |
luoguP9923
[POI 2023/2024 R1] Przyciski
|
0 / 0 |
7 |
|
|
14251 |
luoguP9924
[POI 2023/2024 R1] Satelity
|
0 / 0 |
9 |
|
|
14252 |
luoguP9925
[POI 2023/2024 R1] Zapobiegliwy student
|
0 / 0 |
8 |
|
|
14376 |
luoguP9974
[USACO23DEC] Candy Cane Feast B
|
0 / 0 |
5 |
|
|
14378 |
luoguP9975
[USACO23DEC] Cowntact Tracing 2 B
|
0 / 0 |
5 |
|
|
14388 |
luoguP9976
[USACO23DEC] Farmer John Actually Farms B
|
0 / 0 |
5 |
|
|
14389 |
luoguP9977
[USACO23DEC] Bovine Acrobatics S
|
0 / 0 |
6 |
|
|
14390 |
luoguP9978
[USACO23DEC] Cycle Correspondence S
|
0 / 0 |
5 |
|
|
14391 |
luoguP9979
[USACO23DEC] Target Practice S
|
0 / 0 |
6 |
|
|
14392 |
luoguP9980
[USACO23DEC] Flight Routes G
|
0 / 0 |
6 |
|
|
14393 |
luoguP9981
[USACO23DEC] Minimum Longest Trip G
|
0 / 0 |
7 |
|
|
14395 |
luoguP9982
[USACO23DEC] Haybale Distribution G
|
0 / 0 |
6 |
|
|
14396 |
luoguP9983
[USACO23DEC] Cowntact Tracing P
|
0 / 0 |
9 |
|
|
14397 |
luoguP9984
[USACO23DEC] A Graph Problem P
|
0 / 0 |
8 |
