-
Delphi时间设置得到Windows系统时间
Delphi获取Windows当前时间，并设置系统时间，功能类似于Windows时间设置程序，先获取系统时间中的年月日、时分秒信息，然后可以自定义各个时间信息。
- 2022-11-17 15:45:03下载
- 积分：1
-
37699-1128931-agence-de-location-de-voiture
说明： java code vrp for management location vihecules
- 2019-05-09 07:19:00下载
- 积分：1
-
Excelbiaogemima
解Excel表格密码,表格密码破解Excelbiaogemima(Excelbiaogemima Excelbiaogemima)
- 2016-08-13 11:12:48下载
- 积分：1
-
BatteryManagement_v4_r2014a
说明： 搭建双向DC-DC双电路，实现直流微网并网运行蓄电池恒压充放电(A bidirectional DC-DC dual circuit is built to realize the constant voltage charge and discharge of the DC micro-grid connected to the grid)
- 2021-04-22 09:41:13下载
- 积分：1
-
用于三轴重型车辆非线性车辆模型
说明： 用于三轴重型车辆非线性车辆模型，此模型为非线性三自由度模型，可用于三轴车辆仿真(Nonlinear Vehicle Model for Three-axle Heavy Vehicle)
- 2020-07-04 00:00:02下载
- 积分：1
-
panorama
说明： 图片拼接 实现了多个图片的无缝拼接技术，完美无瑕(Picture stitching achieves seamless stitching technology of multiple pictures, perfect and flawless)
- 2019-05-27 14:30:45下载
- 积分：1
-
Computer-Organization
本文档是计算机组成原理的课堂讲义，准确的讲述了该课程的主要内容(This document is a computer organization class notes, accurately describes the main elements of the course)
- 2011-06-02 13:18:38下载
- 积分：1
-
This is a Visual C++ with the preparation of the Sokoban game, deficiencies, wil...
这是一个用Visual C++编写的推箱子游戏，不足之处，见谅。-This is a Visual C++ with the preparation of the Sokoban game, deficiencies, will be forgiven.
- 2022-11-19 20:05:03下载
- 积分：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
-
frmCheckPwd.designer
使用C#编写服务器与客户端界面并用Socket实现通信。(Use C # to write the interface between server and client and use Socket to communicate.)
- 2020-06-25 07:20:01下载
- 积分：1
