计算方法学中经常要实现全列元消去法

自己用VC.NET编写的金山网镖6序列号改写器-own use VC.NET prepared by the Jinshan net dart six serial number for rewrite

菜单图形显示

这是用Fortran语言编写的高斯消元法，解非线性方程组，可用于解决各种非线性方程组-This is the Fortran language with the Gaussian elimination method, solve nonlinear equations can be used to solve various nonlinear equations

自己做的一个 设置密码的小程序,可移植.-own a small set a password, may transplantation.

一个鼠标自动执行函数，他将自动关闭自动点击！-a mouse function automatically, he will automatically closing Click!

最新的算法的说明- Newest algorithm explanation

能够画出直线，矩形，圆形等基本图形，还能选择颜色。-Able to draw a straight line, rectangular, circular and other basic graphics, but also choose the color.

类似于windows的画图板，基于MFC框架，能够实现文件的保存和读取，画点线圆矩形等，可设置线宽，线形和颜色-Similar to the windows of the drawing board, based on the MFC framework, can be achieved to save the file and read, draw points and lines circle rectangle and so on, you can set line width, linear and color

Automates redundant clicking. Record your mous clicks on first use, save the file, then play it any time in the future.

已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right numbered 1,2, ..., n, also know that two adjacent numbers between nodes ChonSu (this tree that links these two nodes in the path of the number of edges). Seeking any two leaf nodes x, y (1 ≤ x ≤ n) between the ChonSu