A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the ...
分类:
编程语言 时间:
2014-11-27 12:53:47
阅读次数:
159
计算直线的交点数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8322 Accepted Submission(s): 3750
Problem Description
平面上有n条直线,且无三线共点,问...
分类:
其他好文 时间:
2014-11-27 12:41:55
阅读次数:
184
基本公式:末项=首项+(项数-1)×公差项数=(末项-首项)÷公差+1首项=末项-(项数-1)×公差和=(首项+末项)×项数÷2末项:最后一位数首项:第一位数项数:一共有几位数和:求一共数的总和
分类:
其他好文 时间:
2014-11-27 12:33:47
阅读次数:
153
/** * Created with JetBrains WebStorm. * User: zhangyi * Date: 13-4-23 * Time: 上午10:57 * To change this template use File | Settings | File Templates....
分类:
Web程序 时间:
2014-11-27 12:21:54
阅读次数:
172
Key Task
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1239 Accepted Submission(s): 495
Problem Description
The Czech Technical Un...
分类:
其他好文 时间:
2014-11-27 10:49:46
阅读次数:
256
海选女主角
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35439 Accepted Submission(s): 15836
Problem Description
potato老师虽然很喜欢教书,但是迫于生活压力,不得不...
分类:
其他好文 时间:
2014-11-27 09:19:22
阅读次数:
157
1023: [SHOI2008]cactus仙人掌图Time Limit:1 SecMemory Limit:162 MBSubmit:1141Solved:435[Submit][Status]Description如果某个无向连通图的任意一条边至多只出现在一条简单回路(simple cycle)...
分类:
其他好文 时间:
2014-11-27 08:00:03
阅读次数:
335
Sort a linked list in O(n log n) time using constant space complexity.Analsys:We use Merge Sort.NOTE: We should practice other sort algorithm, linke Q...
分类:
其他好文 时间:
2014-11-27 01:35:39
阅读次数:
213
Cow Exhibition
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 9429
Accepted: 3624
Description
"Fat and docile, big and dumb, they look so stupid, they a...
分类:
其他好文 时间:
2014-11-27 00:18:20
阅读次数:
258
题意:
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum prof...
分类:
其他好文 时间:
2014-11-27 00:17:48
阅读次数:
227