xiaobian_的博客

题目描述：There are always some problems that seem simple but is difficult to solve.ZYB got N distinct points on a two-dimensional plane. He wants to draw a magic line so that the points will be divided ...

D. 宇恒棋单点时限: 1.0 sec内存限制: 256 MBQQ小方以前不会下宇恒棋，现在他会了，所以他急切的想教会你。宇恒棋的规则是这样的：在一个 n×m 的棋盘上，QQ小方和你各有一枚棋子。你们轮流行动，每一次轮到一方的回合时，他必须把自己的棋子往上，下，左或右移动一格，但不能超出棋盘的边界。如果这一方的棋子吃掉了另一方的棋子，也就是这一方在他的回合将自己的棋子移动到了另一方棋子的位...

母牛的故事 有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始，每年年初也生一头小母牛。 请编程实现在第n年的时候，共有多少头母牛？Input输入数据由多个测试实例组成，每个测试实例占一行，包括一个整数n(0<n<55)，n的含义如题目中描述。 n=0表示输入数据的结束，不做处理。Output对于每个测试实例，输出在第

链接：https://ac.nowcoder.com/acm/contest/889/J题目描述：Initially, the entire coordinate plane is colored white. N rectangles were painted black. The i-th rectangle has bottom-left corner (i-1, Li) and top...

题目描述Amy asks Mr. B problem C. Please help Mr. B to solve the following problem.Given an array ai with length n, and a base b.For each permutation {ri} of {ai}, we count the number of inversions as...

题目描述Find the value of∑NK=1( (KM) & M ) mod 1e9+7，where & denotes the bitwise AND operator.输入描述:The first and only line of input contains two space-separated integers, N, M (1 <= N <...