搜索内容

最新文章
  • 日记

    2019 多校(MUTC) Diary Round 4

    大家好,我是(这场比赛里啥都没干的)XGN。今天的BLOG由我来糊写。 赛前 由于昨天的CF,我和MK早上起的都不早,大概都是11点左右吧。正当我在玩TH的时候,SYR的“I AM READY”到了,我才发现已经11:59了。于是匆忙没吃午饭便开始了。SYR从1001开始,我从1005开始,MK……
    XGN 2019-07-31
  • 日记

    2019 多校(MUTC) Diary Round 3

    2019 多校(MUTC) Diary Round 3 大家好,又与大家见面了!我是差点爆0的syr。 今天的多校又是一个三人线上交流的round,我在世贸,那就多讲一些世贸打比赛的体验吧。 比赛环境 比赛来到现场的有:(hyh, ycs, jt) (sy, wsr, myf) (wjy, whr, hsc,cxw) (zrm, hqg, xxx)………
    admin 2019-07-30
  • DevLog

    博客迁移记

    因为之前那台aliyun机器性能不够,再加上也快到期了,就决定迁站到Azure 2c4g上. Step 1 首先把网站目录整个打包成zip,网站数据库打包成sql,再下下来,具体指令我就不再说了吧23333 Step 2 开好机器后,首先装上lnmp包. 各个版本一定要与之前的相同 然后使用nginx创建网……
    carott 2019-07-27
  • 题&解

    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……
    XGN 2019-07-26
  • OBCYSIO

    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 ……
    XGN 2019-07-25
  • OBCYSIO

    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……
    XGN 2019-07-25
  • 日记

    2019 多校(MUTC) Diary Round 2

    hi。我是队中最不给力的XGN。今天是MUTC第二场……我来瞎写一下今天的所见所闻。 「NOON」 中午12:00,比赛开始。和上次一样,我在上课。MK倒是在世贸可以参加比赛。SYR我就不知道了。反正等我到世贸的时候,大概12:15,世贸停电中……SYR没有到,空调没有开,没有灯和……
    XGN 2019-07-24
  • 技术

    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 | ……
    XGN 2019-07-24
  • 技术

    Dr.Jing's Lecture Note Ep.1

    $\mathcal A$ is a collection of combinatorial objects. => $\mathcal A$ and $\mathcal B$ are combinatorically isomorphic if there exist a size-preserving bijection between $\mathcal A$ and $\mathcal B$ Q1 Prove that number of Dyck Paths D_{n-1} equa……
    XGN 2019-07-23
  • OBCYSIO

    Orange Boy Can You Solve It Out? Ep.16

    思考题 of math again Slime Legend II In the world of fantasy, there lives N+1 types of monsters indexed from 0 to N. Each monster can be represented by an integer pow_i - their power. And specially, type 0 is SLIME. Slime has a special ability to "……
    XGN 2019-07-23