包含标签:english 的文章
-
Hellholestudios网站域名更改通知
因为hellholestudios.club即将过期,我们决定启用新的域名hellholestudios.top,所有hellholestudios网站域名均使用hellholestudios.top域名 Due to the domain "hellholestudios.club" is expiring, we decide to use the new domain "hellholestudios.top". All the…… -
INM season 2 ended!!!
INM has ended!!!!! Oh, what a season! Although this season's very short, we did pretty many things and seems it's better than INM season 1. Thanks to all member's efforts! What we did: super slow exp machine super slow slime farm not so slow iron …… -
Green Boy Can't You Solve It Out?
2 problems for div3 participants Bomb Defusing II Statement Find how many years in range [l,r] that it has Sept.1 as a weekend(Sunday and Saturday)? Example l=2017,r=2019 out=2 2018/9/1 is Saturday while 2019/9/1 is Sunday Constriants (Div2A-Div2B)…… -
Orange Boy Can You Solve It Out? Ep. 21.8
思考题 within 5 min Bomb defusing 「Readers, please set up a 5-minute timer before you continue to read」 Green boy envied Orange Boy for having such a high rating. So he decided to send Orange Boy a present: a bomb! The bomb will explode in 5 minu…… -
Orange Boy Can You Solve It Out? Ep.21.5
APPROXIMATE PROBLEM WARNING Metro There are N metro stations in a city. The distance between each two station is a fixed integer x. Your task is to construct some metro lines across the stations. We define a cost from station A to station B as the …… -
Orange Boy Can You Solve It Out? Ep.21
思考题 for bread Bread Story You have a piece of bread which can be seen as a N*M grid. You also have a bottle of jam. You want to put some jam on the bread to make the bread delicious. You can do the following two operations: Put 1 unit of jam on…… -
Forge Server Season1 Ended
You can see the mod list here : modlist You can download the server pack here You can download the client pack here -
THHHS Beta 2 Release
Added two extra stages, download and information at: https://blog.hellholestudios.club/archives/169 screenshot: -
Orange Boy Can You Solve It Out? Ep.20.5
APPROXIMATE PROBLEM WARNING Graph There is a grid of size N*M. Each grid could be "#" or ".". You need to find the shortest path from (1,1) to (N,M) by walking on "." only. But you are NOT given the graph. You can only see the grids near you. That …… -
Orange Boy Can You Solve It Out? Ep.20
「考える問題は簡単ですか」 Programming Detect You are given a directed graph G with N nodes and M edges. Each node has an operation, which could be "def sth" or "use sth". An array of nodes A is called Exceptional iff: - for each 1\leq i\leq |A|-1 ……