QOJ.ac

QOJ

Top Rated Accepted

#292: nanika

Accepted: : 251

#292: ucup-team3515

Accepted: : 251

#296: IllusionaryDominance

Accepted: : 249

#296: Lynia

Accepted: : 249

#296: tzl_Dedicatus545

Accepted: : 249
忙碌着 无为着 继续

#299: tricyzhkx

Accepted: : 248

#299: ucup-team180

Accepted: : 248

#301: huaxiamengjin

Accepted: : 247

#301: travel

Accepted: : 247

#301: ucup-team2307

Accepted: : 247

#301: XY_Eleven

Accepted: : 247

#305: Acoipp

Accepted: : 246

#305: ucup-team2172

Accepted: : 246
法克皮百吨

#307: 617lyq

Accepted: : 245

#307: ucup-team1293

Accepted: : 245

#309: ahihi1234

Accepted: : 244

#309: KobicGend

Accepted: : 244

#311: jrjyy

Accepted: : 243

#311: Register

Accepted: : 243

#311: ucup-team2045

Accepted: : 243

#314: lunchbox

Accepted: : 242

#314: ushg8877

Accepted: : 242

#316: std

Accepted: : 241

#316: wrhaco

Accepted: : 241

#318: carrotqq

Accepted: : 240

#318: nathan4690

Accepted: : 240

#318: piggy123

Accepted: : 240

#321: ucup-team267

Accepted: : 239
哈姆。

#321: ucup-team7870

Accepted: : 239
已完成今日我对着铁质的凳子踢了五下然后把那堆钢栏杆在地上滚了一下然后把椅子夹在了篮筐上大学习

#323: MarSer020

Accepted: : 236

#323: ucup-team135

Accepted: : 236

#325: iee

Accepted: : 235

#325: jqh333

Accepted: : 235

#327: deerdoomer

Accepted: : 234

#327: Diaosi

Accepted: : 234

#327: ETK

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

#327: RDFZchenyy

Accepted: : 234
悟已往之不谏,知来者之可追。实迷途其未远,觉今是而昨非。

#327: Zero_OP

Accepted: : 234

#332: 2021cyq

Accepted: : 233

#332: liuziao

Accepted: : 233

#332: ucup-team7334

Accepted: : 233

#332: wsxcb

Accepted: : 233

#336: moriko

Accepted: : 232

#336: ucup-team4269

Accepted: : 232

#338: ucup-team3586

Accepted: : 231

#338: ucup-team5984

Accepted: : 231

#338: ucup-team6748

Accepted: : 231

#341: MatrixGroup

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

#341: ucup-team5008

Accepted: : 230

#341: ucup-team7754

Accepted: : 230

#344: qzez

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

#345: Calculatelove

Accepted: : 227
Love all my perfect imperfections.

#345: cmll02

Accepted: : 227

#345: sleep

Accepted: : 227

#348: chenshi

Accepted: : 226

#349: Journey_to_Edge_Ring

Accepted: : 225
ECUST_飞向边界环 (est. 2025)Member:hatertumu1thuguanfu

#349: Sai_tqwq

Accepted: : 225

#351: feecle6418

Accepted: : 224
gyh ak ioi

#351: luanyanjia

Accepted: : 224

#351: Sktn0089

Accepted: : 224

#351: SoyTony

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

#351: ucup-team4464

Accepted: : 224

#356: 8BQube

Accepted: : 223

#356: DinoHadzic

Accepted: : 223

#356: ucup-team2819

Accepted: : 223

#359: intiger

Accepted: : 221

#360: Prime

Accepted: : 220

#360: ucup-team7683

Accepted: : 220
一直游到海水变蓝

#362: binminh01

Accepted: : 219

#362: masterhuang

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

#362: ucup-team4478

Accepted: : 219

#362: xlwang

Accepted: : 219

#366: Arkweedy

Accepted: : 217

#366: houzhiyuan

Accepted: : 217

#366: shinonome_ena

Accepted: : 217

#366: ucup-team6852

Accepted: : 217

#370: ucup-team7713

Accepted: : 216

#370: ucup-team7832

Accepted: : 216

#370: ucup-team870

Accepted: : 216

#370: xDarkbluex

Accepted: : 216

#374: gg_gong

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

#374: jxy2012

Accepted: : 215

#374: ucup-team3862

Accepted: : 215

#374: yangjiaxi

Accepted: : 215

#378: nhuang685

Accepted: : 214

#378: ucup-team580

Accepted: : 214

#378: ucup-team7582

Accepted: : 214

#381: ucup-team3790

Accepted: : 213

#382: ucup-team073

Accepted: : 212

#382: ucup-team4938

Accepted: : 212
乌龟风扇俱乐部

#384: lazy1105

Accepted: : 211
ぼっち・ざ・ろっく!

#384: ucup-team3966

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

#384: ucup-team7774

Accepted: : 211

#384: Wu_Ren

Accepted: : 211

#388: jiamengtong

Accepted: : 210

#388: Lzy_

Accepted: : 210

#388: ucup-team228

Accepted: : 210

#388: yoy68

Accepted: : 210

#388: yzhang

Accepted: : 210
如果结果不如你所愿,就在尘埃落定前奋力一搏

#393: do_while_true

Accepted: : 209
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11