QOJ.ac
QOJ
Top Rated Accepted
#292: wrhaco
Accepted: : 279
#295: wangjunrui
Accepted: : 278
丢掉幻想，准备斗争！！！
#296: __jk__
Accepted: : 277
#296: bamboo123
Accepted: : 277
#298: NKheyuxiang
Accepted: : 276
#298: SirTechnical
Accepted: : 276
#298: ucup-team045
Accepted: : 276
#298: ucup-team3099
Accepted: : 276
#302: ucup-team1525
Accepted: : 273
#303: dxbt
Accepted: : 272
#303: ucup-team7961
Accepted: : 272
目标：先刷500题看看实力有没有进步;备忘录：https://contest.ucup.ac/modify_team/ucup-team7961（更新队伍信息）
#305: DinoHadzic
Accepted: : 271
#305: Forever_Young
Accepted: : 271
#305: KevinLikesCoding
Accepted: : 271
$$\pi(n)=\phi\left(n,\pi\left(n^\frac{1}{3}\right)\right)-\pi\left (n^\frac{1}{3} \right ) + 1 - \sum_{p\in \left(n^\frac{1}{3},n^\frac{1}{2} \right] } \pi \left (\frac{n}{p} \right )-\pi(p)+1 $$
#308: yangjiaxi
Accepted: : 270
#309: 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$
#309: nhuang685
Accepted: : 269
#311: as_lyr
Accepted: : 266
#312: ucup-team122
Accepted: : 265
#313: jiamengtong
Accepted: : 264
#314: xDarkbluex
Accepted: : 263
#315: tzl_Dedicatus545
Accepted: : 262
忙碌着 无为着 继续
#315: ucup-team110
Accepted: : 262
#315: XY_Eleven
Accepted: : 262
#318: luanyanjia
Accepted: : 261
#319: garam1732
Accepted: : 260
#319: huaxiamengjin
Accepted: : 260
#321: hydd
Accepted: : 259
But are we all lost stars trying to light up the dark?
#321: ucup-team1447
Accepted: : 259
没队要
#321: ucup-team7754
Accepted: : 259
#321: wcyQwQ
Accepted: : 259
#325: He_Ren
Accepted: : 258
#325: travel
Accepted: : 258
#327: ucup-team4464
Accepted: : 257
#327: ucup-team4527
Accepted: : 257
#327: ucup-team5071
Accepted: : 257
#330: ushg8877
Accepted: : 256
#331: ucup-team7879
Accepted: : 255
#331: x3x3
Accepted: : 255
#333: Seniorious
Accepted: : 252
We do not know and will not know
#334: elacient
Accepted: : 251
#334: hshhh
Accepted: : 251
#334: nanika
Accepted: : 251
#334: ucup-team3515
Accepted: : 251
#338: ucup-team6749
Accepted: : 250
#338: Zero_OP
Accepted: : 250
#340: IllusionaryDominance
Accepted: : 249
#340: sqrtqwq
Accepted: : 249
Alea iacta est!
#342: ucup-team180
Accepted: : 248
#343: Diaosi
Accepted: : 247
#343: jqh333
Accepted: : 247
#343: liuziao
Accepted: : 247
#343: tricyzhkx
Accepted: : 247
#343: ucup-team2307
Accepted: : 247
#343: ucup-team7899
Accepted: : 247
#349: Sktn0089
Accepted: : 246
#349: ucup-team2172
Accepted: : 246
法克皮百吨
#351: 617lyq
Accepted: : 245
#351: intiger
Accepted: : 245
#351: ucup-team1293
Accepted: : 245
#354: ChiFAN
Accepted: : 244
你是翅膀也是我肩膀
#355: jrjyy
Accepted: : 243
#355: Register
Accepted: : 243
#355: ucup-team2045
Accepted: : 243
#358: lunchbox
Accepted: : 242
#359: nathan4690
Accepted: : 241
#359: std
Accepted: : 241
哼
#361: GotoHiotori
Accepted: : 240
我大概，一辈子也忘不了 CRYCHIC
#362: carrotqq
Accepted: : 239
#362: ucup-team267
Accepted: : 239
哈姆。
#364: ucup-team7725
Accepted: : 238
#365: sunnygreen
Accepted: : 237
https://www.luogu.com.cn/article/1w0l0mmq
#366: lazy1105
Accepted: : 236
ぼっち・ざ・ろっく！
#366: ucup-team135
Accepted: : 236
#366: ucup-team7736
Accepted: : 236
#369: iee
Accepted: : 235
#369: incent
Accepted: : 235
entr inc=incent
#369: MarSer020
Accepted: : 235
#372: ETK
Accepted: : 234
「我是星 我愿投身前途未卜的群星，为梦长明。」
#372: Journey_to_Edge_Ring
Accepted: : 234
ECUST_飞向边界环 (est. 2025)Member:hatertumu1thuguanfu
#372: wsxcb
Accepted: : 234
#375: RDFZchenyy
Accepted: : 233
悟已往之不谏，知来者之可追。实迷途其未远，觉今是而昨非。
#375: ucup-team7466
Accepted: : 233
#375: xmdxmdxmd
Accepted: : 233
#375: zdczdc
Accepted: : 233
#379: 2021cyq
Accepted: : 232
#379: ucup-team4269
Accepted: : 232
#381: MatrixGroup
Accepted: : 231
どうか どうか どうか | 可是真实的人生，必定是单调、残酷，而缺乏色彩的
#381: moriko
Accepted: : 231
#381: ucup-team3586
Accepted: : 231
#381: ucup-team5984
Accepted: : 231
#381: ucup-team6748
Accepted: : 231
#381: ucup-team7832
Accepted: : 231
#387: ucup-team5008
Accepted: : 230
#388: Calculatelove
Accepted: : 228
Love all my perfect imperfections.
#388: qzez
Accepted: : 228
对于无向图的情况，基尔霍夫矩阵为 $K=D-A$，其中 $D$ 为度数矩阵，$A$ 为邻接矩阵。树的个数为去掉 $K$ 一行一列的行列式的值。对于外向树，$D$ 为每个点的入边度数和，内向树相反。此时需要去掉根所在行列。BEST 定理：有向欧拉图的欧拉回路个数为：内向树个数乘以 $\prod\limits_{i=1}^{n}deg_i$，其中 $deg_i$ 为 $i$ 号点的度数。
#390: cmll02
Accepted: : 227
#390: lnw143
Accepted: : 227
what doesn't kill you makes you stronger
#390: Tianyiwei
Accepted: : 227
#390: ucup-team7683
Accepted: : 227
一直游到海水变蓝