Leading and TrailingApart from the novice programmers, all others know that you can’t exactly represent numbers raisedto some high power. ...
分类：
其他好文 时间：
2015-07-27 22:53:04
阅读次数：
194
Given a binary tree containing digits from 0-9 only, each root-to-leaf path
could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the tota...
分类：
其他好文 时间：
2015-07-26 15:50:28
阅读次数：
113
Problem DescriptionWe divide the HZNU Campus into N*M grids. As you can see from the picture below, the green grids represent the buidings. Given the ...
分类：
其他好文 时间：
2015-07-25 21:16:26
阅读次数：
106
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 = "great":
great
/ gr ...
分类：
其他好文 时间：
2015-07-25 10:44:04
阅读次数：
128
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5288OO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy ai...
分类：
其他好文 时间：
2015-07-25 00:07:22
阅读次数：
131
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep...
分类：
其他好文 时间：
2015-07-24 23:54:38
阅读次数：
107
Problem DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy aimod aj=0,now OO want to know∑i=1...
分类：
其他好文 时间：
2015-07-22 18:32:23
阅读次数：
125
Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit ...
分类：
其他好文 时间：
2015-07-22 18:00:14
阅读次数：
91
http://acm.hdu.edu.cn/showproblem.php?pid=5288
Problem Description
OO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy ai mod aj=0,now OO want to k...
分类：
其他好文 时间：
2015-07-21 22:21:22
阅读次数：
157
Problem DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy aimod aj=0,now OO want to know∑i=1...
分类：
其他好文 时间：
2015-07-21 20:30:27
阅读次数：
142
