关于超过几何分布
摘要：clc syms r format long s=0; n=10; w=[-1,-1,-1,-1,-1,1,17,179,1299,2599,24999]; % for k=0: 10 % s=s+ nchoosek(20,k)*nchoosek(60,n-k)/nchoosek(80,n); %
阅读全文
posted @ 2019-05-29 15:02
05 2019 档案
最长游程问题
摘要：关于这段的代码 static void T12() { var dic = new String[] { "H", "T" }; var total =1000000; var count=0; var k = 5; var n = 30; var rnd=new Random(Environmen
阅读全文
posted @ 2019-05-16 15:10
