- 博客(11)
- 资源 (13)
- 收藏
- 关注
原创 喜极而泣!杭电OJ——1002 A + B Problem II
A + B Problem IIProblem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of the i
2012-09-30 18:17:42 12436 4
原创 杭电1023——Train Problem II
Train Problem IIProblem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders
2012-09-30 15:10:09 6155 1
原创 杭电OJ--1021 Train Problem I
Train Problem IProblem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Igna
2012-09-30 01:05:48 992
转载 STL之vector的使用
STL之vector的使用第一部分 使用入门vector可用于代替C中的数组,或者MFC中的CArray,从许多说明文档或者网上评论,一般一致认为应该多用vector,因为它的效率更高,而且具备很好的异常安全性。而且vector是STL推荐使用的默认容器,除非你知道你有特殊需要,使用vector不能满足你的需求,例如需要容器在head和tail高效的插入和删除,或者在任何位置高效的
2012-09-27 23:20:26 844
原创 杭电OJ——1018 Big number!
Big Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionIn many applications very large integers numbers are required. Some o
2012-09-25 15:50:30 3527
原创 杭电OJ——1016 Prime Ring Problem
Prime Ring ProblemProblem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjace
2012-09-24 22:56:25 7390 2
原创 杭电OJ--1013 Digital Roots
Digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThe digita
2012-09-23 17:53:25 3912
原创 关于next_permutation函数的模拟!
现在有一道很简单的题目,那就是输出1——n的所有排列数!比如说,输入n=5;那么要求求出1,2,3,4,5这几个数所有的排列数!c++中有一个next_permutation函数,它包含在algorithm头文件中,可以方便的求出所有的排列数,可是你知道它是怎么实现的么?现在,我对那个函数进行了简单的模拟,模拟函数如下:/************
2012-09-22 11:46:02 1892 1
原创 杭电OJ——Tempter of the Bone
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThe doggie found a bone in an ancient m
2012-09-21 00:33:17 1316 1
原创 杭电OJ ——1009——FatMouse' Trade
FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionFatMouse prepared M p
2012-09-20 01:16:34 2818
原创 杭电OJ——1006 Tick and Tick
Tick and Tick Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThe thre
2012-09-19 22:50:05 2375
如何设计程序(How to design programs)官网的答案以及英文原版教程
2015-12-10
VC++编程技术与难点剖析(辛长安,梅林)
2015-04-26
Advanced Archive Password Recovery Professional v4.54.48+注册码
2013-09-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人