资源列表
kirch
- kirch 网络等效电阻问题 给定一个由n 个结点构成的网络电路，结点编号为1，2，…，n。结点间连接着m个电 阻。网络等效电阻问题要求计算结点1和n 之间的等效电阻。-kirch equivalent resistance network of a given problem of n nodes of a network circuit, nodes numbered 1,2, ..., n. Connected between nodes m-resistance. Problem r
kni
- kni 骑士共存问题 给定一个由n 个结点构成的网络电路，结点编号为1，2，…，n。结点间连接着m个电 阻。网络等效电阻问题要求计算结点1和n 之间的等效电阻-kni Knight coexistence given an n-node network consisting of circuit nodes numbered 1,2, ..., n. Connected between nodes m-resistance. Equivalent resistance network pro
rooks
- rooks彩车问题，在一个n×n 格的棋盘上放置着若干个车。按照国际象棋的规则，车可以攻击与之处在同一行或同一列上的棋子。彩车问题要求用最少颜色为给定的车着色，使棋盘的任何行和列上都没有同色的车。-rooks float problem in an n × n chessboard grid was placed on the number of cars. In accordance with the rules of chess, you can attack with car in the
Monkey
- 猴子吃桃数组解决 有一群猴子摘了一堆桃子，他们每天都吃当前桃子的一半且再多吃一个，到了第10天就只余下一个桃子。求出原来这群猴子共摘了多少个桃子。-Monkey eating a group of monkeys to solve an array of peach picked a bunch of peaches, peaches they currently eat every day and then eat a half, to the first 10 days left in a
fast
- 数据结构课程中的快速排序方法，控制台应用程序-Data structures course in the quick sort method, the console application
Classical-100-cases-of-c-program
- 这是关于C语言的 基本练习 关于一些重要算法 和数据结构 和基本知识的-This is the basic exercises on the C language on a number of important algorithms and data structures and basic knowledge
Josephus
- 用C++实现Josephus约瑟夫问题，简单的小程序，供初学者参考-In C++ implementation Josephus Josephus problem, a small little program
123
- 最小生成树算法 结构精简，C++语言实验，编译通过-Minimum spanning tree algorithm is lean, C++ language experiments, compiled by
4
- 字符串数据的组织和处理 标准C++库的使用。 指针的使用方法。 通过debug观察指针约内容及其所指的对象的内容。 通过动态内存分配实现动念数组，并体会指针在其中的作用 -String data organization and processing of standard C++ libraries use. Pointer is used. Observation about the contents of the debug pointer and the conten
programa-base-fila
- recursividade com lista encadeada
programa-fila-struct
- recursividade fila struct
programa-fatorial
- rprograma fatorial c