func_code_string: #include <bits/stdc++.h>   const int M = 5004;   int n, m, a[55], b[55];   double p[55], eps = 1e-9;   double f[55][5005], cnt;   double chk(double x) {     for (int i = n; i >= 1; i--) {       for (int j = m + 1; j <= M; j++) f[i + 1][j] = x;       for (int j = 0; j <= m; j++) {         f[i][j] = (f[i + 1][j + a[i]] + a[i]) * p[i] +                   (f[i + 1][j + b[i]] + b[i]) * (1 - p[i]);         if (f[i][j] > x) f[i][j] = x;       }     }     return f[1][0];   }   int main() {     scanf( %d%d , &n, &m);     for (int i = 1; i <= n; i++) {       scanf( %d%d%lf , &a[i], &b[i], &p[i]);       p[i] = p[i] / 100;     }     double l = 0, r = 1e9;     while (l + eps < r) {       long double mid = (l + r) / 2.0;       if (chk(mid) < mid)         r = mid;       else         l = mid;       cnt++;       if (cnt > 128) break;     }     printf( %.9lf n , l);   }   