包含标签:xgn 的文章
-
Orange Boy Can You Solve It Out? Ep.20
「考える問題は簡単ですか」 Programming Detect You are given a directed graph G with N nodes and M edges. Each node has an operation, which could be "def sth" or "use sth". An array of nodes A is called Exceptional iff: - for each 1\leq i\leq |A|-1 …… -
Orange Boy Can You Solve It Out? Ep.19.5
野兽成分更多的思考题 广西省人大音乐II 不支持audio!! Electric Heritage Haniyasushin Keiki loves crafting. She has n kinds of items. The i-th kind of item has name name_i. She also has m recipes. The i-th recipe needs len_i of different kinds of di…… -
2019 多校(MUTC) Diary Round 8
大家好,我是许久不见的XGN。今天早上闲着没事干,就决定把Blog给糊写了。 Before Start 12:00,比赛正式开始。可是我们队仍然在讨论某教练请我们吃饭的问题。白送饭,当然恰。但是只有SYR一人应邀前往。为什么?MK在老家,当然不能;我又不可能在6点之前赶到餐馆,…… -
Orange Boy Can You Solve It Out? Ep.19
比以往更加黑暗的思考题 广西省人大音乐 不支持audio!! Idolatrize World Haniyasushin Keiki loves crafting. She has n kinds of items. The i-th kind of item has name name_i. She also has m recipes. The i-th recipe needs len_i of different kinds of dif…… -
2019 多校(MUTC) Diary Round 4
大家好,我是(这场比赛里啥都没干的)XGN。今天的BLOG由我来糊写。 赛前 由于昨天的CF,我和MK早上起的都不早,大概都是11点左右吧。正当我在玩TH的时候,SYR的“I AM READY”到了,我才发现已经11:59了。于是匆忙没吃午饭便开始了。SYR从1001开始,我从1005开始,MK…… -
Orange Boy/Red Girl/Legendary Grandmeow Can You Solve It Out?
思考题 for grand contest Orange Boy(Monk.eyk.ing),Red girl(Mack.erel.pike) and their cat LGM(Legendary.Grand.Meow) are a happy family. But in fact, they are the heroes that is helping the world in silent. One day, the earth is under the attack…… -
Orange Boy Can You Solve It Out? Ep.18
思考题 about poems Is your love as confusing as the sun acquiesced? Once a Chinese poem said: There's sun in the east but rain in the west, Is your love as confusing as the sun acquiesced? Now you are given a undirected weighted graph G of N …… -
Orange Boy Can You Solve It Out? Ep.17
思考题 for Hakurei Reimu Legacy of Lunatic Kingdom ZJS loves playing Touhou. In the famous STG game Touhou:Legacy of Lunatic Kingdom the game rules are defined as follows: The game consists of N "stages". Player start from Stage 1 and ends at Stage…… -
2019 多校(MUTC) Diary Round 2
hi。我是队中最不给力的XGN。今天是MUTC第二场……我来瞎写一下今天的所见所闻。 「NOON」 中午12:00,比赛开始。和上次一样,我在上课。MK倒是在世贸可以参加比赛。SYR我就不知道了。反正等我到世贸的时候,大概12:15,世贸停电中……SYR没有到,空调没有开,没有灯和…… -
Dr.Jing's Lecture Note Ep.2
OGF - Cayley Formula Question Statement Prove # of trees on [n] = n^{n-2} Solution f:(1,2,3,...,n)\to(1,2,3,...,n) f(1)=1,f(n)=n Functional Digraph(directed graph) D V(D)=[n] 编者注:V为节点集合 (i,j)\in E(D) if f(i)=j 注:E为边集合 Example | ……