- 博客(26)
- 收藏
- 关注
RSS订阅原创 1012 u Calculate e
u Calculate e Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 45362 Accepted Submission(s): 20825 Problem Description A simple mathe
2017-04-10 19:37:25
483
原创 1008 Elevator
Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 70970 Accepted Submission(s): 38965 Problem Description The highest buildin
2017-04-10 18:56:23
345
原创 1005 Number Sequence
Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 169549 Accepted Submission(s): 41835 Problem Description A number se
2017-04-09 22:38:31
306
原创 1004 Let the Balloon Rise
Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 118303 Accepted Submission(s): 46389 Problem Description Contes
2017-04-09 22:20:13
283
原创 1003 Max Sum
Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 240244 Accepted Submission(s): 56725 Problem Description Given a sequence a[
2017-04-09 22:06:38
329
原创 1002 A + B Problem II
A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 353608 Accepted Submission(s): 68625 Problem Description I have a v
2017-04-09 21:58:27
297
原创 13 Fibonacci数
Fibonacci数 时间限制：3000 ms | 内存限制：65535 KB 难度：1 描述无穷数列1，1，2，3，5，8，13，21，34，55...称为Fibonacci数列，它可以递归地定义为 F(n)=1 ...........(n=1或n=2) F(n)=F(n-1)+F(n-2).....(n>2) 现要你来求第n个斐波纳奇数。（第1个、第二个都为
2017-04-09 21:01:44
391
原创 vector的常用用法
Vector包含一系列连续的元素，行为和数组类似，访问其中任意元素或在尾部添加元素是在常量级时间复杂度内完成，查找特定元素的位置或在中间插入元素是线性时间复杂度(其实就是和数组一样) back()返回当前vector最末尾一个元素的引用 pop_back()删除末尾的一个元素 push_back()在尾部添加元素 begin()函数返回一个指向当前vector出事元素的迭代器。常用
2017-04-09 19:58:06
437
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人