登录
首页 » Visual C++ » Insert

Insert

于 2013-11-21 发布 文件大小:1KB
0 226
下载积分: 1 下载次数: 1

代码说明:

  POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • point_to_line
    计算点到直线的距离.输入两点坐标确定一个直线,再输入一个点的坐标,计算该点到直线的距离.(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)
    2020-11-30 15:09:27下载
    积分:1
  • american_heritage
    USACO中的American heritage,用C++编写,运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)
    2013-07-21 18:31:10下载
    积分:1
  • communication
    VC简易通讯录,加强C的编程,熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
    2012-09-02 17:11:12下载
    积分:1
  • data-struct
    对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
    2012-10-09 17:03:41下载
    积分:1
  • huffmancode
    哈夫曼编码程序,实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)
    2008-01-14 13:55:11下载
    积分:1
  • B_Tree
    B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)
    2020-10-18 18:17:26下载
    积分:1
  • huffman_src22
    本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)
    2007-06-15 16:02:25下载
    积分:1
  • Calender
    日历显示,查询1900年后的日历。每一屏显示一年的日历祥情。(Calender dispaling. Acess the calender detail of years after 1900.)
    2011-12-18 14:57:15下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • C-data
    大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
    2016-12-23 23:43:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载