搜索内容

OBCYSIO
  • Orange Boy Can You Solve It Out? Ep. 50
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 50

    anniversary 思考题 Very Easy Problem Wow! OBCYSIO has reached 50 episodes! Let's celebrate using a very popular and easy problem. Hikari and Ninetail are playing a game on an undirected graph of N nodes and M edges. They move in turns, with Hikari ……
    XGN 6天前
  • Orange Boy Can You Solve It Out? Ep.18.5 (the lost obcysio)
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.18.5 (the lost obcysio)

    Note: this problem is drafted on 2019/7/30 by XGN and not released. It's now released on 2022/1/2 by Zzzyt under his permission. Statement Yuqi has an rooted indexed tree T of N nodes indexed from 1 to N. The node 1 is the root. Now on each node th……
    admin 2022年1月2日
  • Orange Boy Can You Solve It Out? Ep. 49
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 49

    思考题 so easy just to prove I am not dead ESL Wulpit is a divine fox spirit. She is learning Chinese. So she doesn't understand English. One day she received an English string S of n lower case characters. XGN told her how her name would be like i……
    XGN 2021年12月25日
  • Orange Boy Can You Solve It Out? Ep. 48
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 48

    思考题 with git Version Control You are given a DAG with N nodes and M direcitonal edges. Node 1 has 0 in degree. We define a node i is required for node j if i is in any path from 1 to j. You are given Q queries, for each query you are given A and……
    XGN 2021年8月25日
  • Orange Boy Can You Solve It Out? Ep. 47
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 47

    Long time no see 思考题 Tree Traversing Hikari has a tree of N nodes. The node #1 is the root. Initially she is at node 1. She can do one of the following three operations: - Move to any adjacant node with cost 1 - Mark current node as temporary st……
    XGN 2021年6月21日
  • Orange Boy Can You Solve It Out? Ep. 46
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 46

    chemistry 思考题 Hydrocarbon Ninetail is building a tree. She has N nodes and she will assign a value from 0 to 3 to each node. All nodes with the same value are indistinguishable. Then she will connect the N nodes with N-1 edges so that they form ……
    XGN 2021年4月18日
  • Orange Boy Can You Solve It Out? Ep. 41-43
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 41-43

    OBCYSIO Ep.41 to 43 is hosted on XGN's blog. As I am lazy to copy, please read them here
    XGN 2021年4月14日
  • Orange Boy Can You Solve It Out? Ep. 45
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 45

    From Hexo Useful 思考题!! Replace Hikari is a cute white dragon girl. She is helping Ninetail - a fox girl, her master - correct composition.The original composition is a string S and the corrected one is another string T. Hikari claimed that……
    XGN 2021年4月5日
  • Orange Boy Can You Solve It Out? Ep. 44
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 44

    From Hexo String 思考题!! Boggle Constructor Ninetail is a clever fox girl. She loves to play Boggle! the rules are simple: Each player searches for words that can be constructed from the letters of sequentially adjacent cubes, where "adjace……
    XGN 2021年3月14日
  • Orange Boy Can You Solve It Out? Ep. 40
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 40

    Simple 思考题 Ninja Try to find any of three integers X,Y,Z in a given integer array A of length N so that X+Y=Z. Example Input: A={1,2,3} Output: X=1,Y=2,Z=3 Input: A={0} Output: X=0,Y=0,Z=0 Input: A={1,9,2,6,0,8,1,7} Output: X=1,Y=8,Z=9 Input: A=……
    XGN 2020年4月15日