搜索内容

题&解
  • Orange Boy Can You Solve It Out? Ep. 68
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 68

    This is a hard version of Ep. 67. If you prefer an easier problem, please see OBCYSIO67. Meeting Point Given a directed graph G of n vertices and m edges. A single vertex S is called the starting point and a single vertex T is called the finish poi……
    XGN 2026年1月8日
  • Orange Boy Can You Solve It Out? Ep. 67
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 67

    Solved! Difficulty: D2C Pretty basic exercise problem from FLA This is an easy version of Ep. 68. If you prefer harder problems, please visit here. Meeting Point Given a directed graph G of n vertices and m edges. A single vertex S is called ……
    XGN 2026年1月8日
  • Orange Boy Can You Solve It Out? Ep. 66
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 66

    Solved! Difficulty: Div2C Classic 思考题 HP You are given a grid of n*m cells. You start from a starting cell S and can move up, down, left or right in one step without leaving the grid. Find: is it possible to visit each cell once and exactl……
    XGN 2025年11月5日
  • Orange Boy Can You Solve It Out? Ep. 65
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 65

    Solved Difficulty: D2C 思考题 inspired by Saionji Video Channel Eastmost Eki There are n points on a 2D plane. You can select any real point as pivot in the rectangle bounded by (a,b) and (c,d) and rotate the entire plane by d degree clockwis……
    XGN 2025年8月24日
  • Orange Boy Can You Solve It Out? Ep. 64
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 64

    思考题 inspired by car lanes Car Lane In Ryuto the capital of the Dragon Kingdom, there is an intersection with k+1 exits. On one lane of one exit, there is a queue of n cars. The i-th car in the queue wants to go in the direction d_i (1\leq d_i\le……
    XGN 2025年8月23日
  • Orange Boy Can You Solve It Out? Ep. 63
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 63

    Solved Difficulty: D2C-D2D 思考题 inspired by Create Mod Assembly Line There is an assembly line consisting of n machines. The i-th machine on the line holds an infinitely long input queue and a processing time of t_i seconds. The machines wo……
    XGN 2025年8月23日
  • Orange Boy Can You Solve It Out? Ep. 62
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 62

    short 思考题 A^B Problem Given two pattern strings A and B that consists of lower-case letters, ? (match a single character) and * (match zero or more characters) For example, abc?d*e matches abcfdppe and abcgde but not ae or abcdee. Find a string ……
    XGN 2025年1月2日
  • crimboi[22] 你什么拓扑?
    教程

    crimboi[22] 你什么拓扑?

    funny problem from model theory problem sheet 题面 Let L be a countable language, T a theory. Let c_1,c_2,... be new constants, L'=L\cup\lbrace c_1,...\rbrace, and let X be the set of all complete theories of L' with T\subset t. Enumerate the L' se……
    HDD 2024年11月15日
  • crimboi[21] 模仿大赛
    教程

    crimboi[21] 模仿大赛

    Rotman algebraic topology上的题, 个人认为出的非常好, 极大增进了读者对\pi_1(S^1)计算过程的理解. 题面 A group G which is also a topology space is called a topological group if \mu:G\times G\to G:(x,y)\mapsto xy and i:G\to G:x\mapsto x^{-1} are contin……
    HDD 2024年9月14日
  • Orange Boy Can You Solve It Out? Ep. 61
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 61

    思考题 featuring Hikari again! Guess the string Hikari and her master Ninetail are playing a game. Hikari thinks of a string S with lower-case letters, and Ninetail asks her to make q modifications one by one. Each modification can only be one of t……
    XGN 2024年9月4日