-
学生成绩管理程序
编制一个统计学生考试分数的管理程序。
设学生成绩已以一个学生一个记录的形式存储在文件中，
每位学生记录包含的信息有：姓名，学号和各...
学生成绩管理程序
编制一个统计学生考试分数的管理程序。
设学生成绩已以一个学生一个记录的形式存储在文件中，
每位学生记录包含的信息有：姓名，学号和各门功课的成绩。
程序具有以下几项功能：求出各门课程的总分，平均分，按姓名，
按学号寻找其记录并显示，浏览全部学生成绩和按总分由高到低显示学生信息等-The preparation of student performance management process of a statistical test scores of students of the management process. For student achievement to a student has a record stored in the document, each student records contain information are: name, school subjects and the results. Procedures have the following functions: to derive the course of the total, average, by name, by the school and its records to find its shows, browse all students score high to low according to the results and information that students
- 2022-02-28 11:40:34下载
- 积分：1
-
一种新的优化算法,解决工程优化(最大,最小及最优等等)问题及优化任务....
一种新的优化算法,解决工程优化(最大,最小及最优等等)问题及优化任务.-A new optimization algorithm to solve engineering optimization (maximum, minimum and optimal, etc.) and optimization of mission.
- 2022-02-14 06:36:16下载
- 积分：1
-
视频的超分辨率增强技术文章，概括说明图像序列上采样增强的算法...
视频的超分辨率增强技术文章，概括说明图像序列上采样增强的算法
- 2022-11-16 08:55:04下载
- 积分：1
-
1.支持文章，论坛，图片，flash，音乐，BT等采集.
2.增加自定文件采集.用户可采集网页中的所有文件.
3.采集内容替换功能，用户可设置替换规则进...
1.支持文章，论坛，图片，flash，音乐，BT等采集.
2.增加自定文件采集.用户可采集网页中的所有文件.
3.采集内容替换功能，用户可设置替换规则进行替换.
4.支持所有文件远程保存到本地.
5.断点续采功能.不受意外关闭影响，重新启动后可继续采集 不重复.
6.支持多种CMS导库，本程序 与(科汛网站管理系统V2.2)整合在一起.
7.增加2级分类采集。适应各种网站采集.
8.缓存机制，在缓存中保存数据，操作常见动作，大量减少对数据库的增加，删除频繁的操作。
用户:admin
密码:admin
-1. Support articles, forums, photos, flash, music, so BT acquisition. 2. an increase in fixed document collection. website users can collect all the documents. 3. content Acquisition replacement gong energy, users can set up rules to replace the replacement. 4. all documents supporting the preservation of the local long-distance. 5. Breakpoint continued mining function. not the closure affected by the accident, the restart will continue after acquisition will not repeat them. 6. CMS support for a variety of guided arsenals, this procedure (Section website flood management system V2.2) together. 7. two additional classification acquisition. Adapt site acquisition. 8. Cache mechanism, the preservation of data cache,
- 2022-01-25 17:08:02下载
- 积分：1
-
汇编原码“案例20七段电子表显示.rar
汇编原码“案例20七段电子表显示.rar-compilation of the original code "20 cases in paragraph 107 electronic table shows. Rar
- 2022-02-12 18:30:34下载
- 积分：1
-
iechajian
IEchajian-IE
- 2022-05-12 10:31:18下载
- 积分：1
-
The word building game is a well known game all over the world. It is also calle...
The word building game is a well known game all over the world. It is also called as scrabble. In this network-supported game, four players can play the game together sharing the same matrix board. Players can join their corresponding opponents directly by searching. I have used UDP sockets for searching the hosted game and TCP sockets for game processing. This game can be played within the subnet.
- 2023-01-15 04:30:03下载
- 积分：1
-
这是模拟物理中导弹打飞机现象的小程序。运行的时候需要把CCBP文件夹包含在头文件中。...
这是模拟物理中导弹打飞机现象的小程序。运行的时候需要把CCBP文件夹包含在头文件中。-This is the simulation of a missile attack against physics phenomena of small aircraft procedures. When run with the need to CCBP folder contains the first document.
- 2022-02-13 03:07:26下载
- 积分：1
-
完全使用ADSI实现域管理的工具.好用,但没有源码.
完全使用ADSI实现域管理的工具.好用,但没有源码.-Full use ADSI to achieve the domain management tools. Easy to use, but no source code.
- 2022-11-04 14:45:07下载
- 积分：1
-
Find prime numbers prepared by screening the function: void sieve (bool isPrime...
编写筛选查找素数函数：
void sieve(bool isPrime[], int n)
其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数，
所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。
然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。
对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
- 2023-03-02 04:45:03下载
- 积分：1
