登录
首页 » Visual C++ » add-sub

add-sub

于 2011-08-15 发布 文件大小:562KB
0 135
下载积分: 1 下载次数: 1

代码说明:

  实现了多项式的创建,实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)

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

发表评论


0 个回复

  • 0908030206xin
    一、 地理数据文件应用 对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。 要求: 1、在C++环境下,通过程序设计实现文本格式数据文件的操作; 2、在打开数据文件后,生成点、线、面三个链表,分别用于记录三种类型的数据。 3、数据文件结构说明 (Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)
    2012-09-14 20:33:26下载
    积分:1
  • function
    提供字符串方法,大家面试可以用,包括找出对称字串(Some string function)
    2011-05-14 23:14:49下载
    积分:1
  • FreeTree
    无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
    2013-10-29 16:31:47下载
    积分:1
  • jose
    约瑟夫环(约瑟夫问题)是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1,最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
    2015-01-09 17:28:41下载
    积分:1
  • qiuhe
    多项式求和,用链表实现的一元多项式求和程序,比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)
    2011-09-15 09:16:38下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • jhgrerfgjz
    一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法(a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix inversion algorithm in C Language)
    2021-03-29 11:39:11下载
    积分:1
  • multiplication
    本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
    2009-05-16 22:04:42下载
    积分:1
  • ok-suit
    说明:  一个实现外部排序的程序,其中gnerate.cpp为产生一个随机的文件,用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)
    2011-03-18 12:30:29下载
    积分:1
  • c++
    一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
    2017-12-13 20:06:55下载
    积分:1
  • 696518资源总数
  • 104734会员总数
  • 23今日下载