QOJ.ac
QOJ
Top Rated Accepted
#101: ucup-team244
Accepted: : 314
#102: ucup-team266
Accepted: : 312
#103: chenxinyang2006
Accepted: : 309
#104: hydd
Accepted: : 308
But are we all lost stars trying to light up the dark?
#104: I_be_wanna
Accepted: : 308
我是废物我怕谁
#106: Lynkcat
Accepted: : 307
#107: Sorting
Accepted: : 303
ㅗ오ㅗ
#108: ucup-team3161
Accepted: : 302
#109: ucup-team3727
Accepted: : 301
#110: PlentyOfPenalty
Accepted: : 300
高亮的是我们，我们是青鱼家军！
#111: zhaohaikun
Accepted: : 296
#112: ucup-team896
Accepted: : 291
#113: znstz
Accepted: : 289
#114: james1BadCreeper
Accepted: : 287
他明白 他明白 我给不起
#115: alpha1022
Accepted: : 286
$$\frac{1}{n_1!n_2!}(1-y)^{n_1+n_2+2} \left(\sum_{j\ge 0} y^j(t+j)^{n_1} \right)\left(\sum_{j\ge 0} y^j((j+1)-t)^{n_2} \right)$$
#116: ucup-team878
Accepted: : 283
#117: Max_s_xaM
Accepted: : 282
#117: ucup-team3602
Accepted: : 282
#119: ucup-team045
Accepted: : 280
#120: ucup-team1525
Accepted: : 274
#121: ucup-team3607
Accepted: : 272
#122: AFewSuns
Accepted: : 269
$\displaystyle\sum_{n \geq 0}{(x+y)^n\frac{u^n}{n!}}=\sum_{k \geq 0}\frac{x}{x-kz}(x-kz)^k\frac{u^k}{k!}\sum_{l \geq 0}\frac{(y+kz)^l}{l!}u^l$
#122: ucup-team4217
Accepted: : 269
#124: ucup-team3705
Accepted: : 268
#125: bulijiojiodibuliduo
Accepted: : 267
#126: ucup-team122
Accepted: : 266
#127: Forever_Young
Accepted: : 263
#127: ucup-team5062
Accepted: : 263
#129: ucup-team018
Accepted: : 262
#130: JohnAlfnov
Accepted: : 261
#131: ucup-team1447
Accepted: : 260
没队要
#132: ucup-team5077
Accepted: : 256
#133: tarjen
Accepted: : 252
Nanani Nanani 喜欢喜欢喜欢training record:https://wiki.cubercsl.cn/Antiamuny_Computation_(2023)https://wiki.cubercsl.cn/Mako,suki_(2024)
#134: Hiraethsoul
Accepted: : 251
#134: ucup-team3556
Accepted: : 251
#136: SorahISA
Accepted: : 250
#136: tricyzhkx
Accepted: : 250
#136: ucup-team180
Accepted: : 250
#139: He_Ren
Accepted: : 249
#140: ucup-team2172
Accepted: : 247
法克皮百吨
#140: ucup-team2307
Accepted: : 247
#142: iee
Accepted: : 245
#142: IllusionaryDominance
Accepted: : 245
#142: ucup-team110
Accepted: : 245
#142: ucup-team1293
Accepted: : 245
#146: zhoukangyang
Accepted: : 244
#147: LuSter_M
Accepted: : 243
#147: Register
Accepted: : 243
#149: MiniLong
Accepted: : 242
#150: ucup-team267
Accepted: : 239
哈姆。
#151: ucup-team4527
Accepted: : 238
#152: sdoi
Accepted: : 237
$$P_{a_i}(x) = [t^{a_i}]\frac{1}{1-xF(t)}$$
#153: ucup-team3648
Accepted: : 236
#154: ucup-team2045
Accepted: : 233
#155: carrotqq
Accepted: : 232
#155: ucup-team3586
Accepted: : 232
#155: ucup-team902
Accepted: : 232
#158: ucup-team3515
Accepted: : 231
#159: qzez
Accepted: : 229
对于无向图的情况，基尔霍夫矩阵为 $K=D-A$，其中 $D$ 为度数矩阵，$A$ 为邻接矩阵。树的个数为去掉 $K$ 一行一列的行列式的值。对于外向树，$D$ 为每个点的入边度数和，内向树相反。此时需要去掉根所在行列。BEST 定理：有向欧拉图的欧拉回路个数为：内向树个数乘以 $\prod\limits_{i=1}^{n}deg_i$，其中 $deg_i$ 为 $i$ 号点的度数。
#159: UESTC_DECAYALI
Accepted: : 229
#161: LaVuna47
Accepted: : 228
#161: ucup-team1817
Accepted: : 228
#161: ucup-team425
Accepted: : 228
#161: ushg8877
Accepted: : 228
#165: OIer_kzc
Accepted: : 226
#165: rqoi031
Accepted: : 226
#167: 8BQube
Accepted: : 222
#168: chenshi
Accepted: : 221
#168: karuna
Accepted: : 221
#170: 11d10xy
Accepted: : 217
格言尚未上传，请稍后查看！
#170: ucup-team4269
Accepted: : 217
#172: KiharaTouma
Accepted: : 215
<https://www.cnblogs.com/KiharaTouma>
#172: repoman
Accepted: : 215
$$\prod_{i=0}^{n-1} (1+q^iz) = \sum_{i=0}^n q^{i(i-1)/2}\binom ni_q z^i$$
#172: ucup-team6561
Accepted: : 215
#172: ucup-team870
Accepted: : 215
#172: yzhang
Accepted: : 215
如果结果不如你所愿，就在尘埃落定前奋力一搏
#177: Crying
Accepted: : 214
第五人格。
#177: zjy0001
Accepted: : 214
#179: ucup-team3790
Accepted: : 213
#180: ucup-team3475
Accepted: : 212
#181: ucup-team228
Accepted: : 211
#181: ucup-team3862
Accepted: : 211
#183: ucup-team1782
Accepted: : 209
#184: Wu_Ren
Accepted: : 208
#184: yoy68
Accepted: : 208
#186: ucup-team123
Accepted: : 207
#186: yyyyxh
Accepted: : 207
What is OI (O_o)?
#188: ucup-team1565
Accepted: : 205
#188: ucup-team580
Accepted: : 205
#190: ucup-team3634
Accepted: : 204
#191: addiyoue
Accepted: : 203
You Know Who
#191: new_dawn_2
Accepted: : 203
#191: ucup-team572
Accepted: : 203
#194: do_while_true
Accepted: : 202
#195: qwq
Accepted: : 201
$\displaystyle \sum_{i=1}^n [i,i+1,\cdots, i+k] \pmod{10^9+7}$
#195: ucup-team1055
Accepted: : 201
#195: ucup-team1617
Accepted: : 201
#195: ucup-team5217
Accepted: : 201
#199: xlwang
Accepted: : 200
#200: ucup-team1002
Accepted: : 199