-
4
说明： 输入某年某月某日，判断是不是闰年?
输入三个整数x,y,z，请把这三个数由小到大输出。 (Importation of a certain period of a day, to judge is not a leap year? Enter three integers x, y, z, invited these three the number of small to large output.)
- 2008-10-13 19:50:15下载
- 积分：1
-
LCD图形数据生成软件源程序，图形大小任意，行列数据排列。...
LCD图形数据生成软件源程序，图形大小任意，行列数据排列。-LCD graphics data generation software source code, graphics arbitrary size, with the ranks of data.
- 2022-08-03 01:47:53下载
- 积分：1
-
Flash蜂窝状图片展示
Flash蜂窝状图片展示，左侧的小圆点可控制显示大图片，创意挺不错，图片切换的时候有动画效果。
- 2022-09-23 16:20:02下载
- 积分：1
-
singlephasedesign
该程序为MATLAB的m文件，用于设计单相LCL并网逆变器控制器参数，控制方式为电容电流和入网电流控制方式，只需输入LCL滤波参数和直流侧电压可计算出双闭环控制器参数。(The program is the m file of MATLAB, which is used to design the controller parameters of the single-phase LCL grid connected inverter. The control mode is the control mode of the capacitance current and the net current. The parameters of the double closed loop controller can be calculated only by the input of the LCL filter parameters and the DC side voltage.)
- 2018-05-02 21:12:17下载
- 积分：1
-
57098
说明： Tracyh widom distribution function
- 2020-04-08 04:30:46下载
- 积分：1
-
备忘录模式-游戏角色状态01
一个简单的查找无向图最短路径的界面程序，练习用(A simple interface program for finding the shortest path of undirected graph.)
- 2020-06-24 18:00:01下载
- 积分：1
-
Myaodv_test.cc.tar
NS3 aodv协议仿真 可控制节点速度(NS3 AODV protocol simulation)
- 2017-12-18 15:28:59下载
- 积分：1
-
pk
说明： pk法求颤振,可以求得机翼的颤振速度，提供参考(pk method the chatter, you can obtain the flutter speed reference)
- 2015-05-29 18:35:06下载
- 积分：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
-
阿里云直播云端相关Java的SDK aliyun-openapi-java-sdk-master
阿里云直播云端相关Java的SDK，需要的可以参考一下(ali play live,if you need,you could download,thank you!)
- 2020-06-25 03:20:02下载
- 积分：1
