POJ2151 动态规划

 #include <iostream>
 #include <cstring>
 #include <cstdio>

 using namespace std;

 int m, t, n;
 ][][];
 ][];
 double p1, p2;

 int main()
 {
     while (scanf("%d%d%d", &m, &t, &n) && m) { //这里的&&写成了&，wa了1个小时
         memset(dp, , sizeof(dp));
         ; i <= t; i++) {
             ; j <= m; j++)
                 scanf("%lf", &p[i][j]);
         }

         ; i <= t; i++) {

             dp[i][][] = 1.0;
             ; j <= m; j++) {
                 dp[i][j][] = dp[i][j - ][] * ( - p[i][j]);

                 ; l <= j; l++) {
                     dp[i][j][l] = dp[i][j - ][l] * ( - p[i][j])
                                 + dp[i][j - ][l - ] * p[i][j];
                 }
             }
         }

         ;
         ;

         ; i <= t; i++) {
             p1 = ;
             ; j < n; j++)
                 p1 += dp[i][m][j];
             s1 *= p1;
         }

         ; i <= t; i++) {
             p2 =  - dp[i][m][];
             s2 *= p2;
         }
         printf("%.3lf\n", s2 - s1);
     }
     ;
 }