思考题 in ancient Chinese Orange Boy Can You Solve It Out? / 神犇，解乎？ 令和元年九月二十一日，余与神犇同饮，乐也。见月色空明，开而无雨，犇曰「如此宴酣之乐，何不以卵玩之以陶冶情操？」，杂然相许。 但见数卵，神犇摆之成堆。共N堆，i堆A_i卵耳。犇问之「……

搬运NFLS训练 NFLS Programming Training 2019-9-19 For international readers, please scroll down. A - 求和(sum.cpp) Statement 求 f(n)=a^{n+k} 的第q项到p项的和。 Input n k q p Output 一个整数，取模10^9+7 Example In: 2 0 2 3 Out: 12 Constriants For 100……

思考题 in poems Uncomment In a, programmers' day, Comment, all the lines I may. N lines, there should be. Commented A_i as I've been. Select a region, Toggle its comment. Cost of all, is (R-L+1)*A+B for all. Or add a comment, just in one line. Move……

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)……

思考题 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……

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 ……

思考题 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……

XIZCM今天上课的时候叫我填个坑，我想如果以后高一要停课可以给个集训经验参考，就同意转载一下 以下两篇都是我之前写的blog 2019： zhengruioi 2019金华峰会游记 马上模拟赛开始了，zhengruioi.com 用起来了，这篇blog应该会被翻出来吧 我是跳跳 序： 今年是我第二年……

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 ……

「考える問題は簡単ですか」 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 ……