线路微机保护的界面,用标准C写成的很好的欢迎大家共同学习,...

经典的CDMA扩频通信书籍，A.J.维特比编写-Classic books CDMA Spread Spectrum Communication, AJ Viterbi prepared

网页设计与制作 全部课件 配《网页设计与制作》-Web design and production of all the courseware with

vc的一些原码,对于帮助学习和提高很有帮助-vc some of the original code, for help to learn and improve very helpful

自己做的labview 小程序，LV8.5版的，初学者参考学习-Labview do their own small programs, LV8.5 version, the reference for beginners to learn

用C++实现的简易终结者小游戏，可以运行， 不过功能很简单-C++ implementation of the simple Terminator game

个人所得税计算器 v个人所得税计算器 -Personal Income Tax Calculator Individual Income Tax Calculator v

将笛卡尔坐标系上的点定义为一个服务类Point，Point类提供求得坐标系上两点间距离的功能、获取和设置坐标的功能、获取极坐标的功能，和完成对已创建的Point类对象统计功能。设计测试Point服务类的应用程序主类，测试并显示输出提供功能的结果。(求以点(1,1)为极坐标原点，点(5,5)的极坐标)-Will be a point on the Cartesian coordinate system is defined as a service class Point, Point class provides coordinates obtained on the function of the distance between two points, access and set coordinates, polar coordinates to obtain functions, and the completion of the Point that have been created class object statistical functions. Design Test Point service class application" s main class to provide functionality to test and display the output results. (Seeking to point (1,1) to polar coordinates origin point (5,5) in polar coordinates)

资源描述允许用户选择图像。用户可以选择任何颜色的图像软件会告诉我们它的颜色is.allows用户选择图像。用户可以选择任何颜色从图像软件会告诉它是什么颜色。允许用户选择图像。用户可以选择任何颜色从图像软件会告诉它是什么颜色。允许用户选择图像。用户可以选择任何颜色从图像软件会告诉它是什么颜色。允许用户选择图像。用户可以选择任何颜色从图像软件会告诉它是什么颜色。

精灵动画的实现，编游戏的基础 二维游戏的经典基础-the realization of part of the game of the classic 2-D game based

单循环赛中选手胜负序列求解问题 名称：单循环赛中选手胜负序列求解问题 内容：有n个选手 P 1 ,P 2 ,P 3 ,… ,P n 参加了的单循环赛，每对选手之间非胜即负。现要求求出一个选手序列 P 1 ,P 2 ,P 3 ,… ,P n , 使其满足 P i 胜 P i+ 1 (i=1,… ,n-1) 。 -Single round robin tournament players winning sequence to solve the problem name: the outcome of single round-robin tournament players to solve the problem sequence elements: There are n-player P 1, P 2, P 3, ..., P n participated in a single round-robin between each pair of players Non-win or negative. Players are now required to find a sequence of P 1 " , P 2" , P 3 " , ..., P n" , to meet the P i " W P i+ 1" (i = 1, ..., n-1).