D. Bear and BlocksLimak is a little bear who loves to play. Today he is playing by destroying block towers. He builtntowers in a row. Thei-th tower is...
分类：
其他好文 时间：
2015-09-16 00:55:47
阅读次数：
237
C -Circular SequenceTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionSome DNA sequences exist in circular forms as i...
分类：
其他好文 时间：
2015-09-15 21:43:24
阅读次数：
173
//reject overly long 2 byte sequences, as well as characters above U+10000 and replace with ?$some_string = preg_replace('/[x00-x08x10x0Bx0Cx0E-x19x7F...
分类：
Web程序 时间：
2015-09-15 14:19:59
阅读次数：
326
QuestionAll DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes us...
分类：
其他好文 时间：
2015-09-15 07:01:19
阅读次数：
128
（一）最一开始的做法是使用 map 记录每个10个字符的字符串的个数，超过2就push_back进ans。但是MLE了，说明采用string并不是一个好方法。
下面是MLE的代码：
class Solution {
public:
vector findRepeatedDnaSequences(string s) {
vector ans;
map mp;...
分类：
其他好文 时间：
2015-09-12 00:53:47
阅读次数：
186
Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an a...
分类：
其他好文 时间：
2015-09-10 22:26:22
阅读次数：
190
1068. Find More Coins (30)时间限制150 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueEva loves to collect coins from all over the universe, including s...
分类：
其他好文 时间：
2015-09-10 11:02:58
阅读次数：
175
Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he t...
分类：
其他好文 时间：
2015-09-08 13:52:07
阅读次数：
128
Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n) The xor of an ...
分类：
其他好文 时间：
2015-09-05 12:24:20
阅读次数：
169
C. SequenceTime Limit: 1 SecMemory Limit: 256 MB题目连接http://codeforces.com/gym/100114DescriptionInteger sequences are very interesting mathematical obj...
分类：
其他好文 时间：
2015-09-03 20:27:15
阅读次数：
150
