ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
33 | P33 矩阵乘法 | 2 / 12 | 10 | |
34 | P34 最大流 | 2 / 4 | 10 | |
35 | P35 最小费用流 | 0 / 0 | (None) | |
36 | P36 子串查找 | 2 / 43 | 9 | |
37 | P37 普通平衡树 | 0 / 0 | (None) | |
38 | P38 文艺平衡树 | 0 / 0 | (None) | |
39 | P39 二逼平衡树 | 0 / 0 | (None) | |
40 | P40 维护全序集 | 0 / 0 | (None) | |
41 | P41 多项式乘法 | 0 / 0 | (None) | |
42 | P42 并查集 | 0 / 0 | (None) | |
43 | P43 乘法逆元 | 0 / 0 | (None) | |
44 | P44 后缀排序 | 0 / 0 | (None) | |
45 | P45 三维偏序CDQ分治 | 0 / 0 | (None) | |
46 | P46 最大异或和 | 0 / 0 | (None) | |
47 | P47 k 大异或和 | 0 / 0 | (None) | |
48 | P48 无源汇有上下界可行流 | 0 / 0 | (None) | |
49 | P49 有源汇有上下界最大流 | 0 / 0 | (None) | |
50 | P50 有源汇有上下界最小流 | 0 / 0 | (None) | |
51 | P51 正则表达式 | 0 / 0 | (None) | |
52 | P52 「模板」单源最短路 | 1 / 5 | 10 | |
53 | P53 持久化序列 | 0 / 0 | (None) | |
54 | P54 「离线可过」动态图连通性 | 0 / 0 | (None) | |
55 | P55 「强制在线」动态图连通性 | 0 / 0 | (None) | |
56 | P56 最小生成树 | 0 / 1 | 10 | |
57 | P57 除数函数求和 1 | 0 / 0 | (None) | |
58 | P58 除数函数求和 2 | 0 / 0 | (None) | |
59 | P59 最大流 加强版 | 0 / 0 | (None) | |
60 | P60 Lyndon 分解 | 0 / 0 | (None) | |
61 | P61 树状数组 1 :单点修改,区间查询 | 0 / 0 | (None) | |
62 | P62 树状数组 2 :区间修改,单点查询 | 0 / 0 | (None) | |
63 | P63 树状数组 3 :区间修改,区间查询 | 0 / 1 | 10 | |
64 | P64 二维树状数组 1:单点修改,区间查询 | 0 / 0 | (None) | |
65 | P65 二维树状数组 2:区间修改,单点查询 | 0 / 0 | (None) | |
66 | P66 二维树状数组 3:区间修改,区间查询 | 0 / 0 | (None) | |
67 | P67 最小瓶颈路 | 0 / 0 | (None) | |
68 | P68 最小瓶颈路 加强版 | 0 / 0 | (None) | |
69 | P69 类欧几里得算法 | 0 / 0 | (None) | |
70 | P70 树链剖分 | 0 / 0 | (None) | |
71 | P71 最小树形图 | 0 / 0 | (None) | |
72 | P72 回文子串 | 0 / 2 | 10 | |
73 | P73 质数判定 | 0 / 1 | 10 | |
74 | P74 DFS 序 1 | 0 / 0 | (None) | |
75 | P75 DFS 序 2 | 0 / 0 | (None) | |
76 | P76 DFS 序 3,树上差分 1 | 0 / 0 | (None) | |
77 | P77 DFS Order IV | 0 / 0 | (None) | |
78 | P78 01 分数规划 | 0 / 0 | (None) | |
79 | P79 挑战多项式 | 0 / 0 | (None) | |
80 | P80 多项式求立方根 | 0 / 0 | (None) | |
81 | P81 子集卷积 | 0 / 0 | (None) | |
82 | P82 集合覆盖计数 | 0 / 0 | (None) | |
83 | P83 集合划分计数 | 0 / 0 | (None) | |
84 | P84 Tutte 多项式 | 0 / 0 | (None) | |
85 | P85 Knapsack Problem on Tree | 0 / 0 | (None) | |
86 | P86 乘法逆元 2 | 0 / 0 | (None) | |
87 | P87 快速幂 2 | 0 / 0 | (None) | |
88 | P88 高斯消元 2 | 0 / 0 | (None) | |
89 | P89 高精度除法 | 0 / 0 | (None) | |
90 | P90 拉格朗日插值 | 0 / 0 | (None) | |
91 | P91 拉格朗日插值 2 | 0 / 0 | (None) | |
92 | P92 康托展开 | 0 / 0 | (None) | |
93 | P93 阶乘 mod 大质数 | 0 / 0 | (None) | |
94 | P94 最长公共子串 | 0 / 0 | (None) | |
95 | P95 多项式欧几里得 | 0 / 0 | (None) | |
96 | P96 Runs | 0 / 0 | (None) | |
97 | P97 Binomial Convolution | 0 / 0 | (None) | |
98 | P98 模立方根 | 0 / 0 | (None) | |
99 | P99 动理序列最值 | 0 / 0 | (None) | |
100 | P100 生成子群阶数 | 0 / 0 | (None) | |
101 | P101 多项式求根 | 0 / 0 | (None) | |
102 | P102 Nim 积 | 0 / 0 | (None) | |
103 | P103 正则二分图匹配 | 0 / 0 | (None) | |
104 | P104 二项式系数 | 0 / 0 | (None) | |
105 | P105 高精度进制转换 | 0 / 0 | (None) | |
106 | P106 单位蒙日矩阵乘法 | 0 / 0 | (None) | |
123 | P123 ACM? 你也想打ACM? | 15 / 159 | 9 | |
124 | P124 任何邪恶? 终将绳之以法! | 6 / 20 | 8 | |
127 | P127 蘑菇! 提莫来采蘑菇啦! | 3 / 8 | 10 | |
128 | P128 锁屏图案? 当然是第k长的最好看! | 4 / 33 | 9 | |
129 | P129 微积分?低程竟然有微积分? | 6 / 39 | 8 | |
130 | P130 SCI! 我就是要发SCI! | 3 / 31 | 9 | |
131 | P131 旅行! 我就是想去旅行! | 1 / 8 | 10 | |
132 | P132 WF?刚打低程就想着WF? | 7 / 22 | 7 | |
24 | P1001 Matrix Fast Power | 8 / 48 | 8 | |
31 | P1003 Stay On The Spot | 4 / 18 | 9 | |
27 | P1007 Tiny-Pang plays games | 0 / 3 | 10 | |
23 | P1010 Sum of all digits | 4 / 16 | 9 | |
112 | P2022A Love Median | 5 / 20 | 8 | |
113 | P2022B Subsequence | 6 / 9 | 9 | |
114 | P2022C Protect the Second Best KK in the World | 7 / 37 | 8 | |
115 | P2022D Accumulation Degree | 6 / 7 | 9 | |
116 | P2022E Cats or dogs? | 3 / 23 | 9 | |
117 | P2022F Examination | 5 / 33 | 8 | |
118 | P2022G Burning | 7 / 11 | 8 | |
119 | P2022H Computational Geometry | 6 / 12 | 9 | |
120 | P2022I Friendship | 6 / 18 | 8 | |
111 | P2022J Eating Snacks | 4 / 51 | 9 | |
110 | P2022K AvavaAva | 7 / 29 | 7 | |
121 | P2022L Cards | 6 / 9 | 9 | |
122 | P2022M Prefix XORs | 4 / 79 | 9 | |
6 | P3005 小胖寻路 | 14 / 27 | 5 |
By signing up a FJNU universal account, you can submit code and join discussions in all online judging services provided by us.