1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
use std::f64;
pub fn n50(v: &[i32]) -> i32 {
if v.is_empty() {
return 0;
}
for n in v.iter() {
assert!(*n > 0);
}
let mut sum: i64 = 0;
let mut half: i64 = 0;
for n in v.iter() {
sum += i64::from(*n);
}
let mut vs = v.to_owned();
vs.sort_unstable();
for i in 0..vs.len() {
half += i64::from(vs[i]);
if 2 * half == sum && i < vs.len() - 1 {
return (vs[i] + vs[i + 1]) / 2;
}
if 2 * half >= sum {
return vs[i];
}
}
0
}
pub fn n90(v: &[i32]) -> i32 {
if v.is_empty() {
return 0;
}
for n in v.iter() {
assert!(*n > 0);
}
let mut sum: i64 = 0;
let mut part: i64 = 0;
for n in v.iter() {
sum += i64::from(*n);
}
let mut vs = v.to_owned();
vs.sort_unstable();
for i in 0..vs.len() {
part += i64::from(vs[i]);
if 10 * (part as i64) == 9 * sum as i64 && i < vs.len() - 1 {
return (vs[i] + vs[i + 1]) / 2;
}
if part as f64 / sum as f64 >= 0.9_f64 {
return vs[i];
}
}
0
}
pub fn mean(v: &[i32]) -> f64 {
let sum1 = v.len() as f64;
let mut sum2 = 0_f64;
for x in v.iter() {
sum2 += f64::from(*x);
}
if sum1 == 0_f64 {
return 0_f64;
}
sum2 / sum1
}
pub fn len_weighted_mean(v: &[i32]) -> f64 {
let mut sum1 = 0_f64;
let mut sum2 = 0_f64;
for x in v.iter() {
sum1 += f64::from(*x);
sum2 += f64::from(*x) * f64::from(*x);
}
if sum1 == 0_f64 {
return 0_f64;
}
sum2 / sum1
}
pub fn cv(v: &[f64]) -> f64 {
if v.is_empty() {
return 0_f64;
}
let n = v.len() as f64;
let mut mean = 0_f64;
for x in v {
mean += x;
}
mean /= n;
let mut x = 0_f64;
for y in v {
x += (y - mean) * (y - mean);
}
x = (x / n).sqrt();
100.0_f64 * x / mean
}
pub fn abs_diff(a: usize, b: usize) -> usize {
if a <= b {
return b - a;
}
a - b
}
pub fn abs_diff_f64(a: f64, b: f64) -> f64 {
if a <= b {
return b - a;
}
a - b
}
pub fn percent_ratio(a: usize, b: usize) -> f64 {
100_f64 * a as f64 / b as f64
}
pub fn make_random_vec(x: &mut Vec<i64>, n: usize) {
x.resize(n, 0);
x[0] = 0;
for i in 1..x.len() {
x[i] = 6_364_136_223_846_793_005i64
.wrapping_mul(x[i - 1])
.wrapping_add(1_442_695_040_888_963_407);
}
}
pub fn binomial_sum(n: usize, k: usize, p: f64) -> f64 {
assert!(n >= 1);
assert!(k <= n);
let mut sum = 0.0;
let mut choose = 1.0;
for _ in 0..n {
choose *= 1.0 - p;
}
let q = p / (1.0 - p);
for i in 0..=k {
sum += choose;
choose *= (n - i) as f64;
choose /= (i + 1) as f64;
choose *= q;
}
sum
}