数值分析 多种C算法
1、离散傅立叶变换与反变换
2、四阶亚当姆斯预估计求解初值问题
3、几种常见随机数的产生
4、指数平滑法预测数据
5、四阶(定步长)龙格--库塔法求解微分初值问题
6、改进的欧拉方法求解微分方程初值问题
7、中心差分(矩形）公式求导
8、高斯10点法求积分
9、龙贝格法求积分
10、复合辛普生法求积分
11、最小二乘法拟合
12、埃特金插值法
Several C algorithms for numerical analysis
1. Discrete Fourier transform and inverse transform
2. Fourth order Adams pre estimation for initial value problem
3. Generation of several common random numbers
4. Forecasting data with exponential smoothing method
5. Fourth order Runge Kutta method for solving differential initial value problems
6. Improved Euler method for solving initial value problems of differential equations
7. Derivation of central difference (rectangle) formula
8. Gauss 10 point method for integral
9. Solving integral by Romberg method
10. Composite Simpson method for integral
11. Least square fitting
12. Etkin interpolation method (2021-04-06, C/C++, 4KB, 下载0次)
1. 对于平面上给定的N个点，给出所有点对的最短距离，即，输入是平面上的N个点，输出是N点中具有最短距离的两点。
2. 要求随机生成N个点的平面坐标，应用蛮力法编程计算出所有点对的最短距离。
3. 要求随机生成N个点的平面坐标，应用分治法编程计算出所有点对的最短距离。
4. 分别对N=100,1000,10000,100000，统计算法运行时间，比较理论效率与实测效率的差异，同时对蛮力法和分治法的算法效率进行分析和比较。
5. 如果能将算法执行过程利用图形界面输出，可获加分。
1. for the n points given on the plane, the shortest distance of all pairs of points is given, that is, the input is n points on the plane, and the output is the two points with the shortest distance in N-point.
2. plane coordinates of n points are randomly generated, and the shortest distance of all pairs is calculated by using brute force method.
3. the plane coordinates of n points are randomly generated, and the shortest distance of all pairs is calculated by the method of division and control.
4. the difference between the theoretical efficiency and the measured efficiency is compared with the statistical algorithm running time with n = 100100010000100000 respectively. Meanwhile, the algorithm efficiency of the brute force method and the method of division and treatment is analyzed and compared.
5. if the algorithm execution process can be output by using the graphical interface, the score can be added. (2021-03-16, C/C++, 1KB, 下载0次)
UniSolder-5.2C 俄罗斯开源
UniSolder-5.2C
A short list of features:
- power: 12-24V, AC or DC (24V 6A toroidal transformer is the best possible power source)
- automatic 1/2 and 1/4 power selection, so only simple single winding 24V can drive all the instruments, from the smallest JBC Nano, to the largest JBC C245.
- 2 separate heater control channels
- 2 independent sensor inputs
- current source on any sensor input 3uA - 12mA, wuth 2 bands (x1, x16) and 256 steps per band
- flexible differential amplifier input selection
- amplifier gain from 0 to 750 in 256 steps
- negative offset selection in 1024 steps
- resistive instrument identification (upto 625 different instruments can be identified by 2 resistors on the connector)
- polynomial floating point voltage/resistance to temperature calculation
- wave shaping to filter out the inductive peaks from series sensor signal
- PID control with power limit
- isolated USB port for firmware updates and live data
- 128x64 OLED display with rich user interface. (2021-02-25, C/C++, 8682KB, 下载4次)
数字式竞赛抢答器主要由74 系列集成电路组成。该抢答器除具有基本的抢答功能外, 还能实现定时、报警和抢答信号的鉴别和首个抢答锁存等抢答相关的多功能。在初始状态主持人掌握整个抢答电路的复位键个开始抢答键，在抢答开始的时候，主持人先将电路复位，接着按下开始键，即可进入30s常规抢答；若在按下开始键之前抢答者按下按钮，电路则会报警（所对应的组的led灯将会点亮），电路将自动扣去提前抢答的组的10分。在有人抢答到后，电路会锁存第一个抢答到的组号，并进入120s答题时间，答对加分，答错则扣分。6个组别原始分数为100分，加减分均为10分/次；计时均为倒计时。本设计的优点在于课题要求的基本功能可以通过仿真实现、各单元电路都在不同方案的基础上择优选取了其中实现功能最多，电路最精简的方案；而本设计的缺点在于总电路过于庞大，用Multisim运行过程缓慢、仿真容易出现错误，同时实物接线复杂易错。
The digital contest Responder is mainly composed of 74 series integrated circuits. In addition to the basic function of the emergency response, the emergency response device can realize the multiple functions related to the emergency response, such as timing, alarm, identification of the emergency response signal and the first emergency response lock. In the initial state, the host holds the reset keys of the whole emergency response circuit. At the beginning of the emergency response, the host resets the circuit first, and then presses the start key to enter the 30s routine emergency response. If the responder presses the button before pressing the start key, the circuit will give an alarm (the LED light of the corresponding group will be on), and the circuit will automatically buckle the 1 of the group in advance emergency response 0 points. (2020-04-17, C/C++, 1372KB, 下载1次)
Matlab方程求根法汇总：BenvliMAX 贝努利法求按模最大实根
BenvliMIN 贝努利法求按模最小实根
HalfInterval 用二分法求方程的一个根
hj 用黄金分割法求方程的一个根
StablePoint 用不动点迭代法求方程的一个根
AtkenStablePoint 用艾肯特加速的不动点迭代法求方程的一个根
StevenStablePoint 用史蒂芬森加速的不动点迭代法求方程的一个根
Secant 用一般弦截法求方程的一个根
SinleSecant 用单点弦截法求方程的一个根
DblSecant 用双点弦截法求方程的一个根
PallSecant 用平行弦截法求方程的一个根
ModifSecant 用改进弦截法求方程的一个根
StevenSecant 用史蒂芬森法求方程的一个根
PYZ 用劈因子法求方程的一个二次因子
Parabola 用抛物线法求方程的一个根
QBS 用钱伯斯法求方程的一个根
NewtonRoot 用牛顿法求方程的一个根
SimpleNewton 用简化牛顿法求方程的一个根
NewtonDown 用牛顿下山法求方程的一个根
YSNewton 逐次压缩牛顿法求多项式的全部实根
Union1 用联合法1求方程的一个根
TwoStep 用两步迭代法求方程的一个根
Montecarlo 用蒙特卡洛法求方程的一个根
MultiRoot 求存在重根的方程的一个重根
Summary of Matlab equation root finding method (2020-03-23, C/C++, 19KB, 下载7次)
fleury算法的具体实现，具体功能为计算欧拉回路。
下面介绍一下：“什么叫做欧拉回路?”。
欧拉回路：有一条路从开始的位置到结束的位置都是同一个位置，经过了所有的点且通过了所有的边，通过的次数只能一次。比如著名的“哥尼斯堡七桥问题”
欧拉路：在欧拉回路的基础上面改一个条件。就是有一条路使得从开始的位置到结束的位置不是一个位置。
The specific function of Fleury algorithm is to calculate Euler loop.
What is Euler circuit.
Euler circuit: there is a road from the beginning to the end of the position is the same position, through all the points and through all the edges, the number of passes can only be one. For example, the famous "Seven Bridge problem of gunnysburg"
Euler Road: change a condition on the basis of Euler circuit. There is a way to make the position from the beginning to the end is not a position. (2019-11-23, C/C++, 2741KB, 下载1次)
排序与查找程序 实现如下步骤要求的功能:
1. 从键盘输入若干个非负整数，遇到-1 则结束输入，将这些数保存到一个足够大的
一维数组中，非负整数的个数保存到变量 n 里面。
2. 使用函数 print_array(int*a,int n)在屏幕上输出排序前的 n 个整数。
3. 使用选择排序函数 select_sort(int *a, int n)将输入的 n 个整数从大到小排序。
4. 使用函数 print_array(int *a, int n)输出排序后的 n 个整数。
5. 从键盘读入要查找的整数 k。
Sort and find program to achieve the following steps required functions:
1. Input a number of non-negative integers from the keyboard, and end the input when -1 is encountered. Save these Numbers to a large enough number
In a one-dimensional array, the number of nonnegative integers is stored in the variable n.
2. Use the function print_array(int*a,int n) to print n integers before sorting on the screen.
3. Use select_sort(int *a, int n) to sort the input n integers from large to small.
4. Use the function print_array(int *a, int n) to print the sorted n integers.
5. Read in the integer k to be looked up from the keyboard. (2019-05-20, C/C++, 588KB, 下载1次)
设计一个八个结点的网络拓扑图，然后为每个结点设定一张路由表，每个结点都存储三个信息：目的结点，下一跳，花销。给每个网络节点一次执行距离矢量路由更新的机会，可用一个循环达到此效果。而且对于每个结点，每一次的更新实际上都是直接用它的相邻结点的内容，在更新之前保存每个结点的旧路由表，为和更新后的新路由表作比较，而且如果没有更新的话也好直接把旧路由表存到新路由表中。在每一次的路由更新中，要确定每个路由表的结点是否发生更新，要提前设定一个标记，首先初始化这个标记为假，每当更新一个结点之后置这个标记为真；如果这个标记为真，那就给更新记录加一次，如果为假，则所有节点的路由表稳定了，可以输出一个节点从初始到稳定的所有路由表数据以及更新次数。
Design a network topology of eight nodes, and then set up a routing table for each node. (2019-05-18, C/C++, 2912KB, 下载0次)
这套策略是利用货币对之间的关系，进行交易。
举个例子，比如澳元和纽元联动性比较强，美元突然下跌，瞬间澳元大涨，但是纽元还没有启动，就在纽元上面做多，澳元择机做空。
并且采用浮赢加仓，所以整套系统跑起来，浮亏很小，非常稳健。
月收益在10%左右，并且根据资金量大小自动计算开仓数量，可以复利增值。
是作为长期价值投资的不错选择。
The strategy is to use the relationship between money pairs to trade.
For example, the linkage between the Australian dollar and the New Zealand dollar is strong. The US dollar suddenly fell and the Australian dollar rose sharply in an instant. But the New Zealand dollar has not started yet. It is long on the New Zealand dollar and short on the Australian dollar.
And the use of floating win warehousing, so the whole system runs, floating loss is very small, very robust.
Monthly earnings are about 10%, and according to the size of funds, the number of open positions can be calculated automatically, which can compound interest and increase value.
It is a good choice for long-term value investment. (2019-04-17, C/C++, 247KB, 下载4次)
初始化界面，用一个矩阵来保存界面的每一个位置，包括颜色跟数值，数值用来区分是墙还是方块还是空格，便于运行时的判断。
2.初始化方块，用4*4矩阵保存，1表示方块，0表示空格。初始7个方块，再利用矩阵旋转，得到剩下的21个方块。
3.运行时先判断再运行，可以保证不会越过墙。每一步判断4*4的方块矩阵下一格是否是方块，是方块就落在上面。
4.一个方块落到底便判断是否满一行，满一行减掉，在判断是否满一行，未满则生成下一个方块。
5.判断游戏结束：即判断最顶上一行是否有方块。
Initialize the interface, using a matrix to save every position of the interface, including color and value. The value is used to distinguish whether it is a wall or a box or a space, which is convenient for runtime judgment.
2. Initialize the block, save it with 4*4 matrix, 1 represents the block, 0 represents the space. The initial seven blocks are rotated by the matrix, and the remaining 21 blocks are obtained.
3. Running judgment before running can ensure that the wall will not be crossed. Each step determines whether the next cell of the 4*4 square matrix is a square or not, and the square falls on it.
4. When a square falls to the end, it judges whether it is full or not, and subtracts the full line. When it judges whether it is full or not, it generates the next square.
5. Judging the end of the game: that is, judging whether the top row has a box. (2019-03-05, C/C++, 3KB, 下载0次)
运算放大器（简称“运放”）是具有很高放大倍数的电路单元。在实际电路中，通常结合反馈网络共同组成某种功能模块。它是一种带有特殊耦合电路及反馈的放大器。其输出信号可以是输入信号加、减或微分、积分等数学运算的结果。 [1] 由于早期应用于模拟计算机中，用以实现数学运算，故得名“运算放大器”。运放是一个从功能的角度命名的电路单元，可以由分立的器件实现，也可以实现在半导体芯片当中。随着半导体技术的发展，大部分的运放是以单芯片的形式存在。运放的种类繁多，广泛应用于电子行业当中。
Operational amplifier (OPA) is a circuit unit with high amplification factor. In practical circuits, some functional modules are usually composed of feedback networks. It is an amplifier with special coupling circuit and feedback. Its output signal can be the result of mathematical operations such as addition, subtraction, differentiation and integration of input signal. [1] Because of its early application in analog computers to realize mathematical operations, it is named "operational amplifier". Operational amplifier is a circuit unit named from a functional point of view, which can be implemented by discrete devices or in semiconductor chips. With the development of semiconductor technology, most of the operation is in the form of single chip. Operational amplifiers are widely used in the electronic industry due to their various types. (2019-02-24, C/C++, 251KB, 下载0次)
LUAC解密工具包含市面所有cocos2的lua脚本加密的解密工具还有一些常用的脚本密码都在里面
LUAC decryption tools include all the Cocos 2 Lua script encryption tools on the market, as well as some commonly used script passwords. (2019-01-31, C/C++, 3379KB, 下载218次)
现有一个景区，景区里面有若干个景点。现欲开发景区信息管理系统，对景点的信息进行管理。使用图的数据结构来保存景区景点信息，为用户提供创建图、查询景点信息、旅游景点导航、搜索最短路径、铺设电路规划等功能。
使用C++语言，通过对景区信息管理系统的四次迭代开发，实现以下主要学习目标：
1)掌握图的定义和图的存储结构，图的创建方法及其应用
2)掌握图的两种遍历方法及其应用
3)掌握迪杰特斯拉（Dijkstra）算法及其应用
4)理解最小生成树的概念、掌握普里姆（Prim）算法及应用
There is a scenic spot and there are several scenic spots in it. Now we want to develop the information management system of scenic spots and manage the information of scenic spots. The data structure of the map is used to preserve the scenic spots information, providing the users with the functions of creating maps, inquiring the information of the scenic spots, the navigation of the tourist attractions, the shortest path searching, the layout of the layout of the circuit and so on.
Using C++ language, the following four main learning objectives are achieved through the development of the scenic area information management system.
1) master the definition and storage structure of graph, create method and application of graph.
2) the two traversing methods of mastering the graph and its application
3) Master Diedje Tesla (Dijkstra) algorithm and its application.
4) understand the concept of minimum spanning tree, master Prim algorithm and application. (2018-06-04, C/C++, 5000KB, 下载3次)
stm32通过串口来升级，从uboot启动，如果不需要升级代码，则直接跳转到应用代码，如果要升级则等待串口通过secureCRT YMODE协议发送来得数据，注意（程序中由于ymodem协议没有发送文件大小，程序中是随便写了一个文件大小，对于我的app足够用），在app中随意按下按键，通过可以从应用程序跳转到uboot，然后发送1，通过ymodem协议发送.bin文件后，按下3则跳转应用程序
STM32 through the serial port to upgrade, starting from uboot, if you do not need to update the code, then jump directly into the application code, if you want to upgrade for the serial port by sending secureCRT YMODE get the data, note (procedures because the ymodem protocol did not send the file size, the program is not to write a file size for me app enough, press the button at random) in app, can jump to the uboot from the application, and then send the 1, through the ymodem protocol to send the.Bin file, press 3 jump applications (2017-12-18, C/C++, 5644KB, 下载27次)
采用下拉菜单的方式实现数字插值方式的选择，并通过回调函数完成相应的插值算法和图像显示，在原始数据的输入和处理上，主要采用字符串的写入和读取与处理方式，实现对原始数据读入和分析。本次设计是对单选按钮的使用、按钮控件的应用及轴显示图形应用的综合设计，最终实现了多种插值算法的切换。通过设计与调试，本工具包集成了一维插值和二维插值中的最邻近插值，最小立方插值，线性插值等插值算法，最后达到对同一组数据可以用不同插值方法设计，通过优化处理得到适合插值算法。
The drop-down menu select digital interpolation method, and the callback function completed corresponding interpolation algorithm and image display, in the original data input and processing, mainly uses the string write and read and treatment, to read and analyze the original data. This design is on the radio button, button control application and axis shows the comprehensive design of graphics applications, finally realizes the switching of various interpolation algorithms. Through the design and debugging, the kit integrates the one-dimensional and two-dimensional interpolation method of the nearest interpolation, the smallest cubic interpolation, linear interpolation, such as interpolation algorithm, and finally achieve the same set of data can be designed using different interpolation methods. By optimizing the processing for the interpolation algorithm. (2017-09-17, C/C++, 15KB, 下载2次)
每一本正式出版的图书都有一个 ISBN 号码与之对应，ISBN 码包括 9 位数字、1 位识别码和 3 位分隔符，其规定格式如“x-xxx-xxxxx-x”，其中符号“-”是分隔符（键盘上的减号），最后一位是识别码，例如 0-670-82162-4 就是一个标准的 ISBN 码。ISBN 码的首位数字表示书籍的出版语言，例如 0 代表英语；第一个分隔符“-”之后的三位数字代表出版社，例如 670 代表维京出版社；第二个分隔之后的五位数字代表该书在出版社的编号；最后一位为识别码。
编写程序判断输入的 ISBN 号码中识别码是否正确，如果正确，则仅输出“Right”；如果错误，
则输出是正确的 ISBN 号码。 输入格式 输入只有一行，是一个字符序列，表示一本书的ISBN号码（保证输入符合ISBN号码的格式要求）。 输出格式
输出一行，假如输入的ISBN号码的识别码正确，那么输出“Right”，否则，按照规定的格式，输出正确的ISBN号码（包括分隔符“-”）。
Write the program to determine whether the identification number is correct in the input ISBN number, and if correct, only output "Right"; if the error,
The output is the correct ISBN number. The input format input has only one line. It is a character sequence that represents the ISBN number of a Book (to ensure that the input meets the ISBN number format requirements). Output format
Output a line, if the input ISBN number is correct, then output "Right", otherwise, in accordance with the specified format, output the correct ISBN number (including the delimiter "-"). (2017-06-20, C/C++, 114KB, 下载1次)
2008年C语言基础暑假作业
一、A:用TC软件在屏幕输出图像，例如一条正弦曲线。
B:用TC软件在扬声器输出声音。
二、用TC软件为小学生随即生成加减法运算题，要求所出试题以*.txt格式保存。
三、用TC软件实现对英文文章中以空格和标点符号为分割的单词数目的统计，要求能把文章（in.dat）读入内存，并能将结果以文件形式（out.dat）输出。
四、对TC软件“俄罗斯方块”游戏的分析与改写，要求了解程序的功能、修改“封面”上的制作人姓名、修改背景音乐并简要写出每个函数实现的功能。
五、完成课堂总结，总结这学期学习C语言课程的得失，并给老师提出授课的改进建议，即如何讲才能更容易接受。
C language based homework on the 2008 summer (2009-07-27, C/C++, 248KB, 下载27次)
对c语言的简单语法分析器 文件说明： input.txt内为输入的源程序，包括for，while和if else控制等 output.txt内为输出的二元单词序列 k.txt为关键字表 l.txt为运算符和界符表 i.txt为该输入的源程序的标志符 c.txt为常数表 个别表需要序列号，这时各表的序列号默认为从1开始，每行加1。 使用说明： 在提示符下输入input.txt文件的路径和文件名字， 运行完成后，打开文件output.txt看结果。
right language syntax analyzer simple document : input.txt for input source, including for, and if else while control output.txt output for the binary sequence k.txt word for the keyword table l.txt for Operators and community tables i.txt the source code for the importation of URI c.txt constant Table Table needs of individual sequences, when the tables are the serial number from a default, plus 1 per trip. Use : In prompt input input.txt document routing and document names, running after output.txt open the file to see the results. (2005-06-28, C/C++, 180KB, 下载41次)