Problem Description
Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra...
分类：
其他好文 时间：
2014-08-17 13:04:42
阅读次数：
205
Description
There are two rows of positive integer numbers. We can draw one line segment between any two equal numbers, with values r, if one of them is located in the first row and the other one i...
分类：
其他好文 时间：
2014-08-16 23:52:01
阅读次数：
560
Description
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack contain...
分类：
其他好文 时间：
2014-08-16 23:51:21
阅读次数：
505
Problem Description
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 ...
分类：
其他好文 时间：
2014-08-16 21:11:11
阅读次数：
169
NSString的使用。1、 - (NSUInteger)length; 返回字符串的长度NSString *demo = @"hello world";NSString *demo two=@"good morning";NSLog(@"%ld", [demo length]);输出为 112- ...
分类：
其他好文 时间：
2014-08-16 18:18:50
阅读次数：
263
To The Max
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8210 Accepted Submission(s): 3991
Problem Description
Given a two-dimensi...
分类：
其他好文 时间：
2014-08-16 17:12:10
阅读次数：
260
to get the ans of how many roads at most that can be built between two line without intersection of roads,we need sort the input sequence at ont edge ...
分类：
其他好文 时间：
2014-08-16 17:01:30
阅读次数：
288
#include #include int zhuanhuan(char str[20]){ if(strcmp(str,"zero")==0) return 0; if(strcmp(str,"one")==0) return 1; if(strcmp(str,"two")==0) ret...
分类：
其他好文 时间：
2014-08-16 16:25:50
阅读次数：
244
Changing Digits
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 2960
Accepted: 952
Description
Given two positive integers n and k, you are asked to genera...
分类：
其他好文 时间：
2014-08-16 15:12:30
阅读次数：
198
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of ...
分类：
其他好文 时间：
2014-08-16 12:37:20
阅读次数：
219
