1401 - Remember the WordTime limit: 3.000 secondsNeal is very curious about combinatorial problems, and now here comes a problem about words. Knowing ...
分类:
其他好文 时间:
2014-08-17 16:44:52
阅读次数:
315
https://oj.leetcode.com/problems/minimum-window-substring/模拟题这道题细节比较多。从左到右扫一遍模拟着做 class Solution {public: string minWindow(string S, string T) { ...
http://poj.org/problem?id=2151
有t个队伍,m道题,给出每个队伍做出每道题的概率。求出每个队伍至少做出一道题并且冠军队伍至少做出n道题的概率。
只要设出数组来,就很直观了。
dp[i][j][k]表示第i个队伍在前j道题中解出k道题的概率,s[i][j]表示第i个队伍最多解出j道题的概率。
首先初始化dp[i][0][0]和dp[i][j][0...
分类:
其他好文 时间:
2014-08-14 20:35:09
阅读次数:
193
遇到这个问题,只需要在eclipse中的Project选项菜单中选择clean,选中当前的项目。clean之后就不会报错了。如图:Clean will discard all build problems and built states。The projects will be rebuilt f...
分类:
移动开发 时间:
2014-08-14 10:28:58
阅读次数:
374
Description
Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem.
There is a very long board with length L...
分类:
其他好文 时间:
2014-08-13 22:28:57
阅读次数:
401
Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowingthat Ray has a photographic memory and this may no...
分类:
其他好文 时间:
2014-08-13 17:54:56
阅读次数:
260
When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.
Suppose there are N people living ...
分类:
其他好文 时间:
2014-08-11 15:02:22
阅读次数:
333
I am having problems with a bit of code that accesses a restful web service. Running this code, it errors out at var httpResponse = (HttpWebResponse)h...
分类:
Web程序 时间:
2014-08-08 20:56:16
阅读次数:
1149
poj 2151 Check the difficulty of problemshttp://poj.org/problem?id=2151题意:此刻有tn道题目,有dn个队伍,知道每个队伍能答对每个题目的概率,问:冠军至少答对n(1 8 #include 9 #include 10 #incl....
分类:
其他好文 时间:
2014-08-07 12:56:40
阅读次数:
309
Cuckoo HashingDescriptionOne of the most fundamental data structure problems is the dictionary problem: given a set D of words you want to be able to ...
分类:
其他好文 时间:
2014-08-06 21:51:12
阅读次数:
458