Vases and Flowers
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2120 Accepted Submission(s): 822
Problem Description
Alice is so...
分类:
其他好文 时间:
2015-01-12 09:31:35
阅读次数:
94
Labeling Balls
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 11256
Accepted: 3230
Description
Windy has N balls of distinct weights from 1 unit to N un...
分类:
编程语言 时间:
2015-01-12 09:26:20
阅读次数:
266
Assign the task
Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 780 Accepted Submission(s): 392
Problem Description
There is a comp...
分类:
其他好文 时间:
2015-01-12 09:25:48
阅读次数:
235
The Suspects
Time Limit: 1000MS
Memory Limit: 20000K
Total Submissions: 23610
Accepted: 11513
Description
Severe acute respiratory syndrome (SARS), an atypical pneu...
分类:
其他好文 时间:
2015-01-12 09:25:34
阅读次数:
148
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is...
分类:
其他好文 时间:
2015-01-12 09:24:02
阅读次数:
136
Endless Jump
Accepted : 10
Submit : 13
Time Limit : 5000 MS
Memory Limit : 65536 KB
题目描述
在一个网格里面,每个格子有一个确定的高度,从一个格子上可以跳到相邻的格子上。 在里面的最左上角的格子上有一个程序猿刚刚打开电脑准备写程...
分类:
其他好文 时间:
2015-01-12 09:20:12
阅读次数:
119
Climbing Stairs https://oj.leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you c...
分类:
其他好文 时间:
2015-01-11 22:56:12
阅读次数:
225
Last non-zero Digit in N!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6432 Accepted Submission(s): 1593
Problem Description...
分类:
其他好文 时间:
2015-01-11 21:44:26
阅读次数:
279
1708: [Usaco2007 Oct]Money奶牛的硬币Time Limit:5 SecMemory Limit:64 MBSubmit:544Solved:352[Submit][Status]Description在创立了她们自己的政权之后,奶牛们决定推广新的货币系统。在强烈的叛逆心理的驱...
分类:
其他好文 时间:
2015-01-11 21:36:57
阅读次数:
283
Easy Task
Time Limit: 2 Seconds Memory Limit: 65536 KB
You are given n integers. Your task is very easy. You should find the maximum integer a and the minimum integer b among these n inte...
分类:
其他好文 时间:
2015-01-11 20:24:46
阅读次数:
242