weixin_43896680的博客

菜鸡复健 F. Fairy, the treacherous mailman time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Fairy is a very excentric mailman. Every now and then, he likes to change some correspondences that he is respon

Today Pari and Arya are playing a game called Remainders. Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1, c2, …, cn...

题意：在过一个路口的时候，主角车车发现自己前面有n个车车，每个车车有三个属性：车车长度，车车离停车线距离，车车最大速度。然后如果有一个车车比前面那个车快，他不能超车，他只能以零距离紧贴在前面的车车后面以前面的车车速度行驶。否则就以最大速度行驶。 主角想要知道自己的车车车头碰到停车线需要的时间。 输入：多组输入 一个n n+1个车车的长度（第0个是主角车） n+1个车车距离停车线的距离 n+1个车车...