包含标签:english 的文章
-
Orange Boy Can You Solve It Out? Ep.12
思考题for Ep.11 Lunatic Walking Orange Boy loves walking. One day, he wanna walk from (sx,sy) to (ex,ey) the boy can walk in three types: from (x,y) to (x\pm1,y) by costing A yuan from (x,y) to (x,y\pm1) by costing B yuan from (x,y) to (x+1,y+1…… -
Orange Boy Can You Solve It Out? Ep.11
是时候放松一下,做一道简单的题目了 Walking Orange Boy loves walking. One day, he wanna walk from (x_1,y_1) to (x_n,y_n) the boy can walk in three types: from (x,y) to (x\pm1,y) by costing A yuan from (x,y) to (x,y\pm1) by costing B yuan from (x…… -
Orange Boy Can You Solve It Out? Ep.10
思考题 from school PKU PK P Given an integer array A of length N. Define a number is strong if it is not the first or the last number in an array and it is strictly bigger than both the number before and after it. For example, in the array [2,0,1,7…… -
Orange Boy Can You Solve It Out? Ep.9
Solved! Difficulty: Div2B-Div2C 思考题 that seems easy A perfect word Given N strings. Find out a longest string so that each substring of it is one of the N strings. Example Input str={a,t,at,orange} Output at Constriants Subtask 1(30%):N<…… -
Orange Boy Can You Solve It Out? Ep.8
思考题 for stupid myself A well-known task Given N segments [L_i,R_i] with weight W_i. Now you want to choose some segments s_1,s_2,s_3,...,s_k so that |[L_{s_1},R_{s_1}]\cap [L_{s_2},R_{s_2}]\cap ...\cap [L_{s_k},R_{s_k}]|*\sum_{i=1}^kW_{s_i} is m…… -
Orange Boy Can You Solve It Out? Ep.7
unsolvable 思考题 for unsolvable monkey Dragon Bone Reborn As a dragon yourself, it is very hard for you to live for every day there're a lot of knights who want to kill you and your bones are frequently broken. Your bone system can be seen as a un…… -
HHSOJ Dev Log 2019/5/19
Added: User talk A change to the nav.jsp Some random changes Beat ZJS New bugs and bug fix readme.md getoj.py & getoj.sh status bug fix -
-
趙鎹圣慕岭~Circle Cycling Circumstance~
趙鎹圣慕岭~Circle Cycling Circumstance~ the second project of ZhaoSong series! This time you will slap your foe hard! Download -
Orange Boy Can You Solve It Out? Ep.6
思考题 for no one Tour You are given a tree of N nodes. Given another integer array A of length M. Little CMJ chooses M sequences of nodes. The i-th of them is X_1,X_2...X_{A_i} and he chooses them so that for each 1\leq i\leq A_i-1,there's an edge……