----hash
文章平均质量分 83
_Occult_
物語が始まった
展开
-
HDU 1247 Hat’s Words
Problem Description A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat’s words in a dictionary. Input原创 2015-04-22 17:14:10 · 342 阅读 · 0 评论 -
POJ 1635 Subway tree systems
Some major cities have subway systems in the form of a tree, i.e. between any pair of stations, there is one and only one way of going by subway. Moreover, most of these cities have a unique central s原创 2017-02-19 18:05:17 · 461 阅读 · 0 评论 -
ZOJ 3602 Count the Trees
Description A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". A subtree of a tree T is a tree consisting of a node原创 2016-04-19 22:11:03 · 331 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1078 Hashing (25)
1078. Hashing (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue The task of this problem is simple: insert a seque原创 2016-03-23 21:12:05 · 470 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1047 Student List for Course (25)
1047. Student List for Course (25) 时间限制 400 ms 内存限制 64000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Zhejiang University has 40000 stud原创 2016-03-11 18:09:05 · 392 阅读 · 0 评论 -
PAT (Advanced Level) Practis 1039 Course List for Student (25)
1039. Course List for Student (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Zhejiang University has 40000 stud原创 2016-03-11 15:18:10 · 369 阅读 · 0 评论 -
HDU 3333 Turing Tree
Problem Description After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of原创 2015-02-26 00:07:26 · 530 阅读 · 0 评论 -
HDU 1264 Counting Squares
Problem Description Your input is a series of rectangles, one per line. Each rectangle is specified as two points(X,Y) that specify the opposite corners of a rectangle. All coordinates will be inte原创 2015-02-25 21:16:09 · 500 阅读 · 0 评论 -
HDU 1075 What Are You Talking About
Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it lea原创 2015-04-22 17:13:10 · 458 阅读 · 0 评论 -
URAL 1486 Equal Squares
During a discussion of problems at the Petrozavodsk Training Camp, Vova and Sasha argued about who of them could in 300 minutes find a pair of equal squares of the maximal size in a matrix of size N ×原创 2017-02-19 18:07:11 · 484 阅读 · 0 评论