搜索内容

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

    Orange Boy Can You Solve It Out? Ep. 69

    Difficulty: Div2C 思考题 from merging table lookup keys Packaging Objects You are given n objects in the memory in ascending order of their starting address. The i-th object has a size of S_i. If adj_i=1 (i>1) then this object is adjacent to th……
    XGN 21小时前
  • Green Boy Can't You Solve It Out? Ep. 3
    OBCYSIO

    Green Boy Can't You Solve It Out? Ep. 3

    思考题 born from a weird hardware Innovative Hardware Given an integer n, find such n_1+n_2+n_3=n or report impossible. Where n_1, n_2\in {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16, 20,24,28,32,36,40,44,48,52,56,60,64} and n_3\in{ 0,1,2……
    XGN 2026年11月9日
  • 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. 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. 60
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 60

    Solved! Difficulty: Div2C :O 竟然有60期了!! 本期题目来源于Group Theory作业,,,难度不高 Congratulations on the 60th entry!! This problem is from my Group Theory homework (not very hard). Z(Sym(n))=ONE In the world of MATHS, a permutation i……
    XGN 2024年4月29日
  • Orange Boy Can You Solve It Out? Ep. 58
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 58

    Solved! Difficulty: Div2 C 思考题 in mid autumn LianLi Branches Wulpit has drawn n nodes(indexed from 1 to n) and n-m edges on paper for homework assignments. They form m rooted trees (aka a forest). However, when she went to the toilet, Fely……
    XGN 2023年12月6日
  • Green Boy Can't You Solve It Out? Ep. 2
    OBCYSIO

    Green Boy Can't You Solve It Out? Ep. 2

    Solved! Difficulty: Div2B 1 problem for div3 participants. Beautiful Dice Painting When Epis is bored, she will draw dices. The canvas contains n*n dots. Initially they are all white. You need to paint exactly v dots black so that the final c……
    XGN 2023年10月22日
  • Orange Boy Can You Solve It Out? Ep. 54
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep. 54

    Solved! Difficulty: Div2C 思考题 in dreamland Construct it XGN dreamt about the following problem when sleeping: You are given a positive integer n (2\leq n\leq 10^8). Output an arithmetic expression that yields the value n with the following……
    XGN 2023年6月3日