Solved 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…… -
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…… -
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…… -
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…… -
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…… -
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…… -
Orange Boy Can You Solve It Out? Ep.18.5 (the lost obcysio)
Solved! Difficulty: Div2D-Div2E 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 n…… -
Orange Boy Can You Solve It Out? Ep. 47
Solved! Difficulty: Div2D 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 - M…… -
Orange Boy Can You Solve It Out? Ep. 31 (Hard)
Solved! Difficulty: Div2E-Div2F If you prefer easier problem, please visit here 思考题 for dw Childish War (Hard) Miss. Broken Tail(Wei Duan) is the Math teacher of NFLS Class 8 Junior 3.She is a kind teacher. Miss. East(Fang Dong) is the Mat…… -
Orange Boy Can You Solve It Out? Ep. 30 (Easy)
Solved! Difficulty: Div2D-Div2E If you prefer harder problem, please visit here 思考题 for dw Childish War (Easy) Miss. Broken Tail(Wei Duan) is the Math teacher of NFLS Class 8 Junior 3.She is a kind teacher. Miss. East(Fang Dong) is the Mat……