Language:
Default
Check the difficulty of problems
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 5419
Accepted: 2384
Description
Organizing a program...
分类：
其他好文 时间：
2015-03-17 17:59:16
阅读次数：
107
题目地址：https://leetcode.com/problems/search-in-rotated-sorted-array/Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are give...
分类：
其他好文 时间：
2015-03-16 17:48:11
阅读次数：
97
Problem DescriptionWe have met so many problems on the tree, so today we will have a query problem on a set of trees. There are N nodes, each nod...
分类：
其他好文 时间：
2015-03-16 17:46:36
阅读次数：
282
A boy named Gena really wants to get to the “Russian Code Cup” finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends that they will s...
分类：
编程语言 时间：
2015-03-16 14:36:02
阅读次数：
141
A boy named Gena really wants to get to the "Russian Code Cup" finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends
that they wil...
分类：
其他好文 时间：
2015-03-15 23:05:06
阅读次数：
277
进行编码时，工程前面莫名有个红X，正当百思不得其解时，发现在[problems]下有如下的消息输出
------
the project was not built due to a resource exists with a different case...
------
按照提示对代码再次进行了check,果然是大小写出了问题，具体如下：
包名为：com.example....
分类：
移动开发 时间：
2015-03-15 21:20:41
阅读次数：
181
https://leetcode.com/problems/combination-sum/Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the ...
分类：
其他好文 时间：
2015-03-15 21:11:57
阅读次数：
122
题目:http://www.spoj.com/problems/PIGBANK/简单的背包问题。。#include#include#define INF 1000000005int ew,fw,n,i,j,t,m;int v[505],w[505],f[10005];int min(int a,in...
分类：
其他好文 时间：
2015-03-15 16:47:39
阅读次数：
126
http://acm.hdu.edu.cn/showproblem.php?pid=5187
Problem Description
As one of the most powerful brushes, zhx is required to give his juniors n problems.
zhx thinks the ith problem's
difficul...
分类：
其他好文 时间：
2015-03-15 12:24:44
阅读次数：
159
原题：https://www.facebook.com/hackercup/problems.php?pid=759650454070547&round=344496159068801题意：给定一颗有根树，在树上下层的节点要给上层节点礼物，根节点的礼物则给慈善会，但是给礼物有个条件就是你不能送你的父节点已经送出的礼物。问满足要求的最少花费。
题解：这个题卡了一段时间，类似于染色问题，可以用树形动态...
分类：
其他好文 时间：
2015-03-14 23:16:48
阅读次数：
155
