- 博客(7)
- 收藏
- 关注
RSS订阅原创 射击游戏
A和B在玩一个射击游戏，战场由若干单位正方形积木组成。积木占据了连续的若干列，且图形周长等于它最小包围矩形的周长。下图(a)是一个合法的战场，但(b)和(c)都不是：(b)中有空列；(c)的图形周长为14，而最小包围矩形（用虚线画出）的周长为12。受重力影响，每个积木的正下方要么是地面，要么是另一个积木。为了让战场看上去错落有致、玩着更刺激，它不能恰好是一个矩形（即：不能每列积木都一样高）。
2014-05-09 11:01:19
1356
原创 poj Stars
#include #include int level[15005]; //下标为等级数 int tree[32005]; //下标为横坐标 int lowbit(int x) { return x & -x; } void update(int x) { int i; for (i=x; i tree[i] += 1; }
2014-05-06 11:17:45
432
转载 poj2481Cows
Cows Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 11742 Accepted: 3884 Description Farmer John's cows have discovered that the clover growing along the
2014-05-06 10:44:32
399
原创 Mysterious Organization
题目描述 GFW had intercepted billions of illegal links successfully. It has much more effect. Today, GFW intercepted a message of a mysterious organization. This mysterious organization package t
2014-05-05 16:47:25
634
原创 Sum of Square
题目描述 Give you a number named N; please tell me how many ways to arrive N use two square integers. 输入 There are many of test cases. For each test case, just one line contains a number N
2014-05-05 16:42:29
770
原创 How many Fibs?
题目描述 Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b].
2014-04-08 13:53:23
479
原创 JAVA大数求余 Basic remains(POJ 2305)
题目描述 Given a base b and two non-negative base b integers p and m, compute p mod m and print the result as a base b integer. p mod m is defined as the smallest non-negative integer k such that p = a
2014-04-08 13:48:38
636
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人