lljjccsskk的专栏

刚开始以为主要难在优化时间，结果发现其实难点在考虑周全…… 首先用数组x和y保存下来h1与h2对m取余的数，并用t1、t2表示h1与h2的循环节长度，s1、s2表示首次取到a1、a2时的秒数。 当s1或s2为0时，即未从x、y中找到a1、a2，直接输出-1即可。 当s1与s2都找到后，由于部分h1与h2的数据不一定在循环节中，用x[h1]与y[h2]分别表示二者进入循环节之前的时间，先将二者

F. Video Cards time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little Vlad is fond of popular computer game

参考：http://www.cnblogs.com/qscqesze/p/5791698.html 写的超级好，我就懒得写了。。。

C. Money Transfers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n banks in the city where Vasya

D. Tree Construction time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output During the programming classes Vasya w

C. Recycling Bottles time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It was recycling day in Kekoland. To c

B. Preparing Olympiad time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You have n problems. You have estimat

D. Mike and Feet time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mike is the president of country What-The-F

C. Glass Carving time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Leonid wants to become a glass carver (the

D. Multipliers Ayrat has number n, represented as it's prime factorization pi of size m, i.e. n = p1·p2·...·pm. Ayrat got secret information that that the product of all divisors of n taken mod

借鉴自http://blog.youkuaiyun.com/u014492306/article/details/48369857 B. Modulo Sum time limit per test 2 seconds memory limit per test 256 megabytes input standard input output s

C. A Problem about Polyline There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – .... We know that the polyline passes thr

Arthur and Table Arthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable. In total the table Arthur bought has n legs, the lengt

CheckpostsTime Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u SubmitStatus Description Your city has n junctions. There are mone-way roads between the junctions. A

D. Pashmak and Parmida's problem Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partner to be clever too (although he's not)! Parmida has pr

C. Epidemic in Monstropolis time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There was an epidemic in Monstro