包含标签：english 的文章
-
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……XGN 2019年5月3日
-
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……MonkeyKing 2019年4月22日
-
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.…… -
Hell Hole Legend 2 Episode 1 - The Hamburger Turnabout Release
What's the story behind the hamburgers? Welcome to Hell Hole Legend 2 Episode 1! Installing Download the game zip and run the PyWright.exe Click "Games" and click on the episode title to play:) Follow ingame instructions. Download For HHS Members,…… -
Orange Boy Can You Solve It Out? Ep.2
Solved! Difficulty: ?? 思考题 for everyone Man on Graph You are given M chains each of N+1 nodes. We call the i-th node on the j-th chain (j,i-1). We define a bridge edge connecting (a,b) and (c,d) as follows: - a≠c - b=d - b and d don't equa…… -
Orange Boy Can You Solve It Out? Ep.1
Solved! Difficulty: Div2E 思考题for everyone Dynamic DP You are given: integer arrays A and dp of length N. integer arrays l and r of length N. For each 2\leq i\leq N,1\leq l_i\leq r_i\leq i-1 Known: dp_1=A_1 dp_i=min(dp[l_i,r_i])+A_i for 2\l…… -
Codeforces Round #551 (Div.2)
Member: Chairman Jing, XGN, ZJS, XZM, ZHD Also In: Dummy Rong,HTC Note:This is not full data. And this is not cheating Problem Solver FST A All ZHD(hacked) B All None C All ZHD(unfinished) D Chairman Jing ZHD(unfinished) E Unsolved …… -
The story of Tengfei Ep.2
The story of Tengfei Episode 2 - The TengFei University Exam Hi, I am your friend ZJS again! As we know, in China we have 高考(University Exam) and in Tengfei country, we have two colleges: one is a special university called 腾飞国大学(Tengfei Univ……