题目描述：
Tino wrote a long long story. BUT! in Chinese...
So I have to tell you the problem directly and discard his long long story. That is tino want to carry some oranges with "Carrying pole", an...
分类：
其他好文 时间：
2015-03-02 13:17:45
阅读次数：
205
class SchoolMember: def __init__(self,name,age): self.name = name self.age = age print 'init SchoolMember: ', self.name def tell(self): print 'name:%s...
分类：
其他好文 时间：
2015-03-01 21:00:54
阅读次数：
137
DAY 2第二天学习继续，今天重点学习函数，数组和类等编程的基本要素。2.1 函数2.1.1 简单定义 def tell_me
puts true
end
定义一个简单的函数（无参无返回值）很简单，使用def end包裹函数体即可。
2.1.2 参数def tell_me(a)
puts a
end
tell_me 1
1
=> nil
使用参数和其他语言类似，加括号加变量名即可。
2.1.2....
分类：
编程语言 时间：
2015-02-28 10:18:49
阅读次数：
231
Binary String Matching时间限制：3000ms | 内存限制：65535KB难度：3描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell ho...
分类：
其他好文 时间：
2015-02-27 13:24:23
阅读次数：
141
http://acm.hdu.edu.cn/showproblem.php?pid=4635
Problem Description
Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the gr...
分类：
其他好文 时间：
2015-02-26 18:35:11
阅读次数：
148
Some people advices college stdudent shoud learn to write a blog.To record beautiful life and think
something meaning about life.
And some guys tell me that it's necessary to have a blog for a techn...
分类：
其他好文 时间：
2015-02-26 16:37:55
阅读次数：
180
Given three integers A, B and C in [-263, 263], you are supposed to tell whether A+B > C.Input Specification:The first line of the input gives the pos...
分类：
其他好文 时间：
2015-02-24 18:36:32
阅读次数：
109
Time Limit:1000MS Memory Limit:32768KBDescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the ...
Given a connected undirected graph, tell if its minimum spanning tree is unique.
Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V', E'), with the following properties:
1...
分类：
其他好文 时间：
2015-02-23 15:33:46
阅读次数：
257
Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given s...
分类：
其他好文 时间：
2015-02-23 09:35:10
阅读次数：
133
