QOJ.ac

QOJ

積分榜 > 通過數

#491: zr

Accepted: : 235

#495: ETK

Accepted: : 234
「我是星 我愿投身前途未卜的群星,为梦长明。」

#495: ucup-team8683

Accepted: : 234

#495: wsxcb

Accepted: : 234

#495: xmdxmdxmd

Accepted: : 234

#499: cbant15

Accepted: : 233

#499: ucup-team6977

Accepted: : 233

#499: UESTC_MatchaParfait

Accepted: : 233

#502: Prime

Accepted: : 232

#502: ucup-team4269

Accepted: : 232

#502: zhenghanyun

Accepted: : 232

#505: 2021cyq

Accepted: : 231

#505: lsj2009

Accepted: : 231

#505: moriko

Accepted: : 231

#505: Nanako7_ix

Accepted: : 231

#505: ucup-team6748

Accepted: : 231

#505: ucup-team8618

Accepted: : 231

#511: rainygame

Accepted: : 230

#511: ucup-team3586

Accepted: : 230

#511: ucup-team5008

Accepted: : 230

#511: ucup-team7697

Accepted: : 230

#515: MatrixGroup

Accepted: : 229
どうか どうか どうか | 可是真实的人生,必定是单调、残酷,而缺乏色彩的

#515: ucup-team5984

Accepted: : 229

#517: Calculatelove

Accepted: : 228
Love all my perfect imperfections.

#517: gmroh

Accepted: : 228

#517: kjhhjki

Accepted: : 228

#517: qzez

Accepted: : 228
对于无向图的情况,基尔霍夫矩阵为 $K=D-A$,其中 $D$ 为度数矩阵,$A$ 为邻接矩阵。树的个数为去掉 $K$ 一行一列的行列式的值。对于外向树,$D$ 为每个点的入边度数和,内向树相反。此时需要去掉根所在行列。BEST 定理:有向欧拉图的欧拉回路个数为:内向树个数乘以 $\prod\limits_{i=1}^{n}deg_i$,其中 $deg_i$ 为 $i$ 号点的度数。

#517: Wansur

Accepted: : 228

#522: cmll02

Accepted: : 227

#522: do_while_true

Accepted: : 227

#522: KnownError_

Accepted: : 227

#522: ucup-team2262

Accepted: : 227

#522: ZnPdCo

Accepted: : 227

#527: feecle6418

Accepted: : 226
gyh ak ioi

#527: ucup-team6634

Accepted: : 226

#529: andreyDagger

Accepted: : 225

#529: asdfsdf

Accepted: : 225

#529: chenshi

Accepted: : 225

#529: monirr

Accepted: : 225

#529: zzzYheng

Accepted: : 225
你好我的朋友

#534: TheBlackFire

Accepted: : 224

#534: ucup-team7532

Accepted: : 224

#534: ucup-team7678

Accepted: : 224

#537: 8BQube

Accepted: : 223

#537: ucup-team2819

Accepted: : 223

#539: SoyTony

Accepted: : 222
真実はいつもひとつ

#539: ucup-team7411

Accepted: : 222

#539: ucup-team968

Accepted: : 222

#542: Lenisel

Accepted: : 221

#542: msk_sama

Accepted: : 221

#544: Arkweedy

Accepted: : 220

#544: Survivor_winner

Accepted: : 220
$$|\mathcal F^\downarrow||\mathcal G^\uparrow|\ge 2^n|\mathcal F^\downarrow\cap \mathcal G^\uparrow|$$

#544: treks

Accepted: : 220

#544: vlomaczk

Accepted: : 220

#544: xlwang

Accepted: : 220

#549: houzhiyuan

Accepted: : 219

#549: masterhuang

Accepted: : 219
不要逃避自己的命运

#549: ucup-team4478

Accepted: : 219

#552: rui_er

Accepted: : 218
可爱

#552: tttfred

Accepted: : 218

#554: alex9801

Accepted: : 217

#554: fast_photon

Accepted: : 217

#554: shinonome_ena

Accepted: : 217

#554: ucup-team5656

Accepted: : 217
有点小幽默

#554: yoy68

Accepted: : 217

#559: annyeong1

Accepted: : 216

#559: Thuw

Accepted: : 216

#559: ucup-team7774

Accepted: : 216

#562: chenyx

Accepted: : 215

#562: IvanZhang2009

Accepted: : 215

#562: jxy2012

Accepted: : 215

#562: NineSuns

Accepted: : 215

#562: rhineofts

Accepted: : 215

#562: ucup-team3862

Accepted: : 215

#562: ucup-team6852

Accepted: : 215

#562: ucup-team870

Accepted: : 215

#570: frankly6

Accepted: : 214

#570: gg_gong

Accepted: : 214
Who am I? Why am I here?

#570: haze

Accepted: : 214
爱在一起或死在一起,舍此别无他途。

#570: infCraft

Accepted: : 214

#570: liangbowen

Accepted: : 214

#570: StefanSebez

Accepted: : 214

#570: ucup-team580

Accepted: : 214

#570: ucup-team7582

Accepted: : 214

#578: ucup-team3790

Accepted: : 213

#578: ucup-team8660

Accepted: : 213

#578: ucup-team8977

Accepted: : 213

#581: diandian2020

Accepted: : 212

#581: sherman2022

Accepted: : 212

#581: ucup-team4938

Accepted: : 212
乌龟风扇俱乐部

#581: yuanshengnb

Accepted: : 212

#585: Lzy_

Accepted: : 211

#585: pk661

Accepted: : 211

#585: ucup-team3966

Accepted: : 211
$$\underline{洹}我\underline{达}美\underline{乐}$$

#585: ucup-team8878

Accepted: : 211

#585: Wu_Ren

Accepted: : 211

#590: Silverwolf

Accepted: : 210

#590: ucup-team228

Accepted: : 210

#590: ucup-team5248

Accepted: : 210

#590: YMH_fourteen

Accepted: : 210
$$4+9+19+10+15+9+14+20=\mathbf{100}$$
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11