坦克大战时间限制：1000ms | 内存限制：65535KB难度：3描述Many of us
had played the game "Battle city" in our childhood, and some people (like me)
even often play it on com...
分类：
其他好文 时间：
2014-06-13 08:24:42
阅读次数：
221
Leather Mulberry spent so many years. Many
Mulberry handbags factory in southwest England. All bags are made from the
original pattern. They are not o...
分类：
其他好文 时间：
2014-06-12 21:28:07
阅读次数：
328
题目
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1 and 0 respective...
分类：
其他好文 时间：
2014-06-10 18:28:49
阅读次数：
207
You are climbing a stair case. It takesnsteps
to reach to the top.Each time you can either climb 1 or 2 steps. In how many
distinct ways can you climb...
分类：
其他好文 时间：
2014-06-10 08:41:34
阅读次数：
206
问题：
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
分析：
该问题是符合斐波那契数列的，具体...
分类：
其他好文 时间：
2014-06-10 08:19:31
阅读次数：
194
题目
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
方法
从后往前求解...
分类：
其他好文 时间：
2014-06-10 07:38:21
阅读次数：
171
How many ways
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2594 Accepted Submission(s): 1528
Problem Description
这是一个简单的生存游戏，你控...
分类：
其他好文 时间：
2014-06-10 07:05:49
阅读次数：
188
Given an infinite number of quarters (25 cents),
dimes (10 cents), nickels (5 cents) and pennies (1 cent), find how many ways to
represent n cents.思路：...
分类：
其他好文 时间：
2014-06-09 20:04:56
阅读次数：
238
1Jboss7下载与安装1.1
官方下载路径：http://www.jboss.org/jbossas/downloads，目前最新稳定版本为7.1.1
final，分别有zip和gz两个版本，本文介绍xp下的zip版本。1.2目录介绍与启动把下载的zip包解压到相关目录，如目录E:/dev_too...
分类：
其他好文 时间：
2014-06-09 18:42:18
阅读次数：
253
题目来源：Light OJ 1026 Critical Links
题意：输出桥
思路：模版
#include
#include
#include
#include
#include
using namespace std;
const int maxn = 10010;
struct Edge
{
int u, v;
Edge(){}
Edge(int u, int v):...
分类：
其他好文 时间：
2014-06-08 04:07:05
阅读次数：
235
