包含标签:english 的文章
-
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…… -
Orange Boy Can You Solve It Out? Ep.5
思考题 for blue boy Roguelike Tree Statement You are given a tree of N nodes. Each node could be 3 status: passable(.), impassable(X), unknown(?). Now we randomly replace each "unknown" to "passable" or "impassable" then we need to find out the exp…… -
Orange Boy Can You Solve It Out? Ep.4
思考题 for nobody Rougelike Game You are given a graph of N*M grids. Each grid can be a wall 'X',a path'.' or unknown '?' One grid is the start point 'S' and one grid is the end point 'E' Now we change the '?' randomly to 'X' or '.' and run shortes…… -
Changing the Skin of Chrome Dino
Tutorial on installing texture packs of Chrome Dino Step 1 Open Chrome Dino anywhere. from chrome://dino maybe Step 2 Press F12, turn to Console and input: Runner.imageSprite.src="<Your image path>" with quotes Note that your image path shou…… -
Red boy can you solve it?
Rong Kong is a filial boy. There are N pears on the table. Both he and his brother can eat them. They both want to eat as much as they can. Each of them weighs a[i]. It costs a[i] time for a boy to eat a pear weighing a[i] and it gives him a[i] sat…… -
Orange Boy Can You Solve It Out? EP.3
思考题 for everyone Man on Graph Given a graph of N nodes and M edges. On node i there are A_i men. Then each person moves along 1 edge randomly connected to the node he stands. But if two men walked along the same edge, they'll fight and both die.……