问题描述
When Deathmoon played MC game, he faced a math problem. When he found a ancient tomb and came in, he found two polynomials f(x) and g(x) no the wall, only did he calculate f(x) + g(x) correctly ...
分类：
其他好文 时间：
2014-05-10 09:57:54
阅读次数：
300
The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have...
分类：
其他好文 时间：
2014-05-10 09:11:21
阅读次数：
334
Given two wordsword1andword2, find the minimum
number of steps required to convertword1toword2. (each operation is counted as 1
step.)You have the fol...
分类：
其他好文 时间：
2014-05-10 01:09:28
阅读次数：
325
Given two words word1 and word2, find the
minimum number of steps required to convert word1 to word2. (each operation is
counted as 1 step.)You have t...
分类：
其他好文 时间：
2014-05-09 19:09:35
阅读次数：
318
JavaScript中的两个等号(==)和三个等号(===)：Determining whether
two variables are equivalent is one of the most important operations in
programming.
分类：
编程语言 时间：
2014-05-09 11:44:17
阅读次数：
579
【题目】
原文：
1.3 Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional variables are fine. An
extra copy of...
分类：
其他好文 时间：
2014-05-07 08:48:12
阅读次数：
372
Paint the Grid Reloaded
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Leo has a grid with N rows and M columns. All cells are painted with either black or white initially.
Two cells A ...
分类：
其他好文 时间：
2014-05-07 07:28:35
阅读次数：
480
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 gr...
分类：
其他好文 时间：
2014-05-07 06:10:17
阅读次数：
370
这道题看似简单，其实很坑爹啊，动不动就是Time Limit Exceeded,
比如我下面这段TLE的代码，我感觉方法是对的，但是too
naive，算法复杂度到了O(N^2)，自然就TLE了而且有一些小语法错误需要注意：for(runner=current+1;;)不能用>；一定所有的case都...
分类：
其他好文 时间：
2014-05-06 11:31:09
阅读次数：
405
给两个长度分别为n和m的序列，现在有两种操作：1.分别选择两个序列的一个非空前缀，切两个前缀的最后一位相同，删除之，得到1分（只累计），消耗e；2.直接删除两个序列，消耗值定于两个序列之前删除的元素个数之和，并且使得得到的分有效（之前没有有效分）...
分类：
其他好文 时间：
2014-05-04 18:10:51
阅读次数：
287
