Search - INT 1 - CodeBus

Search - INT 1 - List

[Data structs] InOutData DL : 2: 此程序对网路传输数据的传输是个很好的东东,其主要是对数据进行压入和压出作了封装, 对int,long,byte,char*和结构均支持, 数据是以流的形式-this procedure to the Internet to transmit data transmission is a very good Eastern, mainly for data indentation made and squeezed out the package, the right int, long, byte, char* and support structure, the data are presented in the form of flow
Date : 2026-01-07 Size : 11kb User : llg
[Data structs] finish01 DL : 0: 一般来说用int型变量超过2^31的数就会溢出。此程序是利用数组对长度很长的整形字符串进行加减操作，并且进行自动测试的例子-int type generally used more than two variables ^ 31 a few will overflow. This procedure is the use of an array of very long length of plastic strings Modified operation, as well as automatic test case
Date : 2026-01-07 Size : 462kb User : 蔡雷
[Data structs] factorialxxxyy DL : 0: 一个最优化的大数阶乘算法,可以计算超过5位数的阶乘,而运算时间只需几秒。-an optimization of large factorial algorithm can calculate the median of over 5 factorial, and the computation time only a few seconds.
Date : 2026-01-07 Size : 196kb User : 刘华
[Data structs] INT DL : 0: 算法分析ACM题目：整数划分算法保证能运行！算法分析课程必备！-ACM Algorithm Analysis Title: integer division algorithm guaranteed to run! Algorithm analysis courses required!
Date : 2026-01-07 Size : 143kb User : 黄子聪
[Data structs] p11566 DL : 0: 编写一个冒泡排序的模板，并利用它分别对int型和字符数据进行排序-The preparation of a bubble sort of template, and use it separately int type and character data to sort
Date : 2026-01-07 Size : 49kb User : 深森青子
[Data structs] Insert_sort DL : 0: void insert_sort(int *a,int n) { if(n==1) return insert_sort(a,n-1) int temp=a[n-1] for(int i=n-2 i>=0 i--) { if(temp<a[i]) a[i+1]=a[i] else break } a[i+1]=temp }-void insert_sort (int* a, int n) (if (n == 1) return insert_sort (a, n-1) int temp = a [n-1] for (int i = n-2 i> = 0 i--) (if (temp <a [i]) a [i+ 1] = a [i] else break) a [i+ 1] = temp)
Date : 2026-01-07 Size : 218kb User : Katherine
[Data structs] sorttest DL : 0: 整数快速排序算法的简单实现。自己在主函数中设定数组。 -quick sort int
Date : 2026-01-07 Size : 2.26mb User : shen
[Data structs] ssd5__adsasdsdexa1 DL : 0: c++数据结构 ssd5的答案很有用保证正确很有用我亲自写的-#include "car.h" Car::Car(string plate) : license_plate(plate), moved(0), aisle(-1) {} Car::Car(string plate, int aisle) : license_plate(plate), moved(0), aisle(aisle) {} int Car::getTimesMoved(void) const { return moved } void Car::setTimesMoved(int m) { moved = m } int Car::getAisle(void) const { return aisle } string Car::getPlate(void) const { return license_plate } bool Car::operator < (const Car& rhs) const { return this->getPlate() < rhs.getPlate() } bool Car::operator == (const Car& rhs) const { return this->getPlate() == rhs.getPlate() }
Date : 2026-01-07 Size : 8kb User : linchen
[Data structs] 3 DL : 0: 实现二分法求解方程。编写并使用以下函数： double SolveRoot(double(*pf)(double x),double a,double b,int n) 这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a<=x<=b)， n是循环次数。例如，如果f(x)=x*x-2，则SolveRoot (f,1,2,100)将返回1.414213562373095，即方程为x*x=2的解。二分法的原理是反复地把区间分为两个相等区间，然后用其中含有解的一半代替该区间，依次类推，得到满足精度的解。它通过检查f(a)和f(b)的符号来判断解是否在区间中。-Achieve the dichotomy solve the equations. To prepare and use the following function: double SolveRoot (double (* pf) (double x), double a, double b, int n) here, pf points to a function f, f used to define the required solution of the equation f (x) = 0 , a and b are unknown solution x of the upper and lower bounds (ie, a < = x < = b), n is the cycle number. For example, if f (x) = x* x-2, then the SolveRoot (f, 1,2,100) will return 1.414213562373095, that is, the equation x* x = 2 solution. Dichotomy of the principle is repeatedly the range is divided into two equal intervals, then half of them containing solution instead of the interval, and so on, accuracy of the solution are met. It does this by checking f (a) and f (b) solutions of the symbol to determine whether the interval.
Date : 2026-01-07 Size : 1.11mb User : 闻悦
[Data structs] sort DL : 0: 给定N个int类型（自定N的上限M，例如M=100000，N的取值不能少于10000）的整数，分别使用插入排序、快速排序、归并排序和堆排序方法进行升幂排序。具体要求： 1 四种排序方法均能得到正确的排序结果。 2 分别统计四种排序中关键字比较的次数和记录交换的次数，并将统计结果显示出来。 -Int a given N-type (since the upper limit set N M, such as M = 100000, N the value of not less than 10,000) of integers, respectively, using the insertion sort, quick sort, merge sort and heap sort methods ascending order. Specific requirements: One of four sorting methods to get the correct sort order. 2 were sorted in the keywords statistical comparison of four times and record the number of exchange and results displayed.
Date : 2026-01-07 Size : 623kb User : rongmeishu
[Data structs] SHORTEST DL : 0: 弗洛伊德求最短路径的VC算法 #include <iostream> using namespace std #define MAXV 50 #define INF 32767 typedef int InfoType //邻接矩阵存储方法 typedef struct { -Freud find the shortest path algorithm# include VC <iostream> using namespace std # define MAXV 50# define INF 32767 typedef int InfoType // adjacency matrix storage method typedef struct {. . . .
Date : 2026-01-07 Size : 909kb User : nannan
[Data structs] jiayouwenti DL : 0: 用贪心算法实现加油问题的代码,而且是以C++实现的。-this is a C++!include<iostream.h> #include<fstream.h> ifstream infile("E:\\jiayou.in") ofstream outfile("E:\\jiaou.out") void jiayou(int*x,int n,int k){
Date : 2026-01-07 Size : 474kb User : 龙政
[Data structs] subset DL : 0: comb(int m,int k)，用归纳法求解m个数集合中的所有k子集-comb (int m, int k), m the number of induction to solve the set of all subsets of k
Date : 2026-01-07 Size : 218kb User : yehui
[Data structs] Link DL : 0: 链表的实现认真书写上传的资料详细功能包含内容说明-I am a primerver i need help i need this thing sorry i m worry void fun（） usigned int a need help
Date : 2026-01-07 Size : 2.25mb User : 张路
[Data structs] SX23 DL : 0: 编写一个函数sort(int A[],int n)，函数的功能是用选择法对数组进行由小到大的排序，其中n为数组A的元素个数。在主函数中输入10个数据，调用函数排序，然后输出排序好的10个数据。（输入数据：6,8,9,1,2,5,4,7,3,18）-Write a function sort (int A [], int n), the function is the function selection method for sorting an array of small to large, where n is the number of elements in the array A. In the main function of data input 10, call the function sort, and then outputs the sorted 10 data. (Input data: 6,8,9,1,2,5,4,7,3,18)
Date : 2026-01-07 Size : 2kb User : macaihong
[Data structs] 3 DL : 0: 输入一个循环链表,每个结点存一些东西,比如存int 数字, 即构造链表, Node1(存数字3)->Node2(6)-> Node3->Node4->Node1, 然后输入一个位置,比如1, 定位到Node2,从Node2开始每隔三个Node删除一个Node,直到该链表删除完-Enter a circular linked list, each node keep some things, such as deposit int number, that is constructed list, Node1 (deposit number 3)-> Node2 (6)-> Node3-> Node4-> Node1, then enter a location, such as 1, positioned to Node2, Node2 start at intervals of from three to delete a Node Node, until the end of the list to delete
Date : 2026-01-07 Size : 334kb User : huanxin
[Data structs] 1234 DL : 0: 1.字符数据变为整型数据 2.计算矩阵的秩 3.输入一个循环链表,每个结点存一些东西,比如存int 数字, 即构造链表, Node1(存数字3)->Node2(6)-> Node3->Node4->Node1, 然后输入一个位置,比如1, 定位到Node2,从Node2开始每隔三个Node删除一个Node,直到该链表删除完. 4. 构造一个结构体链表,每个结点存储学生信息(如学号和姓名), 如(001, 张三),(002, 李四), 要求输入001,能找出相对的名字.即输入001,输出张三.-1 character data into integer data 2 matrix of rank 3 calculated Enter a circular linked list, each node keep some things, such as deposit int number, that is constructed list, Node1 (deposit number 3)-> Node2 (6 )-> Node3-> Node4-> Node1, then enter a location, such as 1, navigate to Node2, Node2 start at intervals of from three to delete a Node Node, until the end of the list to delete 4. construct a linked list structure, each nodes storing student information (such as student number and name), such as (001, Joe Smith), (002, John Doe), requiring the input 001, to find out the name of relative, ie input 001, output seating.
Date : 2026-01-07 Size : 1.29mb User : huanxin
[Data structs] Doubly-linked-. DL : 0: 线性表链式存储（双向链表）插入、删除运算 1、预习要求：线性表的插入、删除相关概念及运算，完成线性表元素的插入、删除。 2、实验目的：（1）了解线性表的插入、删除相关概念；（2）理解线性表的插入、删除过程和结构定义；（3）掌握算法转换为程序的过程中的变化。 3、实验内容及要求： (1) 以“一个较完整的程序范例-顺序表”程序框架为框架 (2）双链表结构体为： typedef struct { int num /学号 char name[10] /姓名 } student；分别建立包含3~5个数据元素的链式存储线性表； (3）实现功能 a)构造空表，直接从键盘输入数据元素 b) 插入、删除、一般查找（给定某一学号x，找到并显示该学生信息）、显示等函数功能 c）设计特殊查找函数findbeforeAndAfter(...)，给定某一学号x，能同时找到该学生第i个前驱的学生信息，以及该学生第j个后继的学生信息，参数x, i，j从键盘输入（4）给出程序运行截图。 -The linear table chain store (doubly linked list) insert, delete operations 1, the preview request: Linear table insert, delete the related concepts and operations, completion of the linear table elements Insert, delete. 2, the purpose of the experiment: (1) to understand the linear table insert, delete the related concepts (2) understanding of the linear table insert, delete, processes and structures defined (3) to grasp the changes in the process of algorithm into a program. 3, experimental content and requirements: (1) "a more complete example of the program- order form" procedural framework within the framework of (2) doubly linked list structure is: typedef struct { int num /Student ID char name [10] /Name } Student Were established to contain three to five data elements in the chain store linear table (3) to achieve functional a) Construct an empty table directly from the keyboard to input data elements b)
Date : 2026-01-07 Size : 318kb User : the spring
[Data structs] 1111 DL : 0: 二叉树的建立演示，可以将你输入的数字建立完全的二叉树-#include <stdio.h> #include <string.h> #include <windows.h> struct BTree { int data struct BTree* left struct BTree* right } //end struct BTree BTree* CreateLeaf(int number) { BTree* l = new BTree l->data = number l->left = 0 l->right = 0 return l }//end CreateLeaf void append(BTree** root, int number) { if (!root) return BTree* t =*root if (!t) { *root = CreateLeaf(number) return }//end if while(t) { if(number == t->data ) return //ignore duplicated elements. if(number < t->data ) { if(!t->left ) { t->left = CreateLeaf(number) return }//end if t = t->left }else{ if(!t->right ) { t->right = CreateLeaf(number) return }//end if t = t->right }//end if }//end while }//end append void PrintLeaf(const BTree* root) { if (!root) return if (root->left ) PrintLeaf(root->left ) printf(" d\t", root->data) if (root->right ) PrintLeaf(root->right )
Date : 2026-01-07 Size : 1.12mb User : 陈龙
[Data structs] BSTree DL : 0: 实现对依次输入的关键字序列建立二叉排序树，并能实现二叉排序树的查找、插入和删除运算。链式存储结构： typedef struct BiTNode{ KeyType key BiTNode* lchild BiTNode* rchild }*BiTree 关键字类型KeyType为int。 -Binary sort tree, and the turn sequence of the keywords entered binary sort tree lookup, insertion and deletion operation. Storage Structure: typedef struct BiTNode {KeyType the key BiTNode* lchild for BiTNode* rchild }* BiTree Keyword Type KeyType to int.
Date : 2026-01-07 Size : 266kb User : 卧龙

« 12 3 4 5 6 7 8 »