t_xliang的专栏

Time travel Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1336    Accepted Submission(s): 292 Problem Description Agent K is

B. Little Pony and Harmony Chest time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Princess Twilight went to

Our happy ending Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 700    Accepted Submission(s): 223 Problem Description There is

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 给定一个数 x，设它十进制展从高位到低位上的数位依次是 a0, a1, ..., an - 1，定义交错和函数： f(x) = a0 - a1 + a2 - ... + ( - 1)n - 1an - 1 例如： f(3214567) = 3 - 2 + 1 - 4 + 5 

E. Pillars time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Marmot found a row with n pillars. The i-th pilla