Probability|Given

来源：互联网发布：趣丸网络编辑：程序博客网时间：2024/05/22 05:21

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=30506#problem/K

#include<map>#include<set>#include<list>#include<cmath>#include<ctime>#include<deque>#include<stack>#include<bitset>#include<cstdio>#include<vector>#include<cstdlib>#include<cstring>#include<iomanip>#include<numeric>#include<sstream>#include<utility>#include<iostream>#include<algorithm>#include<functional>using namespace std ;double ans[ 105 ] , num[ 105 ] ;int vis[ 105 ] , n , r ;void dfs( int k , int sum ){if( sum == r ){double temp = 1 ;for( int i = 1 ; i <= n ; ++i ){if( vis[ i ] ) {temp *= num[ i ] ;}else{temp *= ( 1 - num[ i ] ) ;}}ans[ 0 ] += temp ;for( int i = 1 ; i <= n ; ++i ){if( vis[ i ] )ans[ i ] += temp ;}}else{for( int i = k + 1 ; i <= n ; ++i ){vis[ i ] = 1 ;dfs( i , sum + 1 ) ;vis[ i ] = 0 ;}}}int main(){int Case = 0 ;while( scanf( "%d%d" , &n , &r ) != EOF ){if( !n && !r ) break ;printf( "Case %d:\n" , ++Case ) ;for( int i = 0 ; i < 30 ; ++i ){vis[ i ] = ans[ i ] = 0 ; }for( int i = 1 ; i <= n ; ++i ){scanf( "%lf" , &num[ i ] ) ;}dfs( 0 , 0 ) ;for( int i = 1 ; i <= n ; ++i ){printf( "%.6lf\n" , ans[ i ] / ans[ 0 ] ) ;}}     return 0;}