Pagini recente » Cod sursa (job #423456) | Cod sursa (job #2252712) | Cod sursa (job #2392295) | Cod sursa (job #2432819) | Cod sursa (job #2567355)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("dezastru.in");
ofstream fout("dezastru.out");
int sol[ 27 ] , m , n ;
double prod[ 27 ] , nr , s , a[ 27 ] , f[ 27 ] ;
void Back( int k )
{
for( int i = sol[ k - 1 ] + 1 ; i <= n ; i ++ )
{
sol[ k ] = i ;
prod [ k ] = prod [ k - 1 ] * a [ i ] ;
if( k == m )
{
cout<<prod[k]<<" ";
s += prod [ k ] ;
nr ++ ;
}
else
Back( k + 1 );
}
}
int main()
{
int i;
fin >> n >> m ;
if( m > n / 2 )
m = n - m + 1 ;
for ( i = 1 ; i <= n ; i ++)
fin>> a[ i ];
prod[ 0 ] = 1 ;
Back( 1 );
fout << s / nr ;
return 0 ;
}