Reading of prime numbers, very useful little program, learn from each other

ofdm using 16 qam modulation scheme

this upload sample-this upload sample................

在Visual C++6.0 WinXp下编译通过 采用类来实现,从CString继承而来 数据运算的结果保存在CString类中 理论上可对任意长的数据进行相加 在Release目录下有可执行文件，将*.txt拖放到longadd.exe上即可，*.txt为数据文件。 -In Visual C++6.0 WinXp compiled under implementation through the use of class, inherited from CString computing the results of the data stored in the CString class in theory can be for any length of data combined in the Release directory has the executable file will be Drag and drop the*. txt to longadd.exe on,*. txt file for data.

//就是一个封闭区域，要用不同的颜色填充，先在其内部选中一点象素作为“种子”，对其填充，然后判//断其上下左右的象素是否在封闭区域内且未被填充，如果是则也把它选为“种子”压入栈，再从栈中弹//出一个对其填充，再判断其上下左右的象素，如此往复，直到最后一个象素被填充为止。 //说明程序用递归 来实现 //fill_point(x,y) //把x，y 单元格进行填充 //is_inner(x,y) 判断x,y是否是单元格内部的点，如果是则返回1否则0-Seed filling algorithm

求图中从一个顶点到另一个顶点的一条路径。 //为简化算法，没有提供顶点到其编号的转换函数，函数Path_vtou(ALGraph G,VexIndex v,VexIndex u) //中两顶点参数用的是顶点的编号；函数Printpath(ListType Path)输出的是路径上的顶点编号序列-seeking a map from the vertex to another vertex of a path.// To simplify the algorithm, not to its peak numbered conversion, function Path_vtou (ALGraph G, VexIndex v, u VexIndex)// 2 vertex parameters of the number of vertices; Function Printpath (ListType Path) output is on the path to the peak numbers Sequence

检测windows系统硬件-detection system hardware

wince下的嵌入式文本勾绘以及描述，侧重于文字字体选择-wince embedded under the text painted hook

由用户输入系统进程数(最多50个进程)来模拟优先级调度算法假设进程是同时到达CPU，进程运行时间(1-10秒)和进程优先级 (1-10，10最高1最低)由程序随机产生，进程有2种状态就绪状态（Ready）和完成状态(Complete)首先根据优先级对进程进行排序，再根据优先级分配时间片运行每次分给进程的时间片为1秒，运行完后需运行时间减1优先级减1转下一个进程。如果进程已经完成就插入到完成队列，如果没有完成就重新插入到就绪队列中的正确位置 程序有两种运行方式： 1、可以直接给出最后的运行结果，进程最后的优先级、 运行完每一个进程的时间及完成进程的总时间，进程最后的状态。 2、可以选择自动运行，过程中显示每一次调度信息包括本次调度进程完成队列信息就绪队列信息等*/ -Process user input from a number of systems (up to 50 processes) to simulate priority scheduling algorithm is the assumption that the process of arrival at the same time CPU, the process of run-time (1-10 seconds) and the process priority class (1-10,10 highest minimum 1) randomly generated by the process, the process has two kinds of status status ready (Ready) and achieve status (Complete) First of all, the process in accordance with the priority ranking, and distribution in accordance with the priority of each time slice to run to the process time slice for the second one, to be run after run-time priority class minus one minus one to t

深入浅出mfc1-easy mfc1

VC编程开发的源代码之一-VC programming one of the source code