-
LCA
LCA算法,高效而又快捷,自动轮换,快速而又开销少。(LCA algorithm, efficient and fast, auto-rotation, fast and less overhead.)
- 2012-12-03 19:52:57下载
- 积分:1
-
linear-simultaneous-equations
线性方程组LU分解直接解法,GS迭代、夹克比迭代、SOR迭代等Matlab代码(linear simultaneous equations)
- 2010-12-03 14:29:51下载
- 积分:1
-
3-UDP
说明: stm32F103和W5500udp例程(Stm32F103 and W5500udp routines)
- 2020-06-22 10:40:02下载
- 积分:1
-
kzds8.0
用于仿制图章,仿制电子章,骑缝章,公务章(Used for imitation stamps, imitation electronic chapters, riding stitches, business chapters)
- 2018-05-02 15:57:09下载
- 积分:1
-
Advanced-C-language
C语言进阶资料,一共分为八讲,提高的好资料。(Advanced C language data, a total of eight, good data to improve the.)
- 2013-10-17 19:04:15下载
- 积分:1
-
数值模拟
数值模拟,二维,可以运行,不够完善,相移正演
- 2023-03-12 14:15:03下载
- 积分:1
-
C_sharp_TCP
c# 的TCP/IP客户端及服务器的实现、界面实现(TCP/IP client and server implementation of c#)
- 2018-08-12 19:11:56下载
- 积分:1
-
217
说明: 用c语言完成(2,1,7)卷积编码,viterbi解码(Complete with c language (2,1,7) convolutional coding, viterbi decoding)
- 2010-04-28 22:11:44下载
- 积分:1
-
c#与halcon编程之读取及处理图片
本代码描述了如何从电脑中选取一张图片,然后利用halcon导出的代码进行处理,用户可以更改halcon处理图片的部分,即可实现同的处理方式!适合新手学习
- 2022-08-24 02:16:51下载
- 积分:1
-
poj3941
poj 3941
Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same.
In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)
- 2013-07-16 20:45:28下载
- 积分:1