Pagini recente » Cod sursa (job #265049) | Cod sursa (job #3125121) | Cod sursa (job #1976861) | Istoria paginii runda/oni_2009_11-12_2 | Cod sursa (job #1821542)
#include<fstream>
using namespace std;
ifstream in("dezastru.in");
ofstream out("dezastru.out");
int n,m;
int v[26];
float c[26];
float produs=1,suma=0;
int k=0;
void afis()
{
produs=1;
k++;
for(int i=1;i<=m;i++)
produs=produs*c[v[i]];
suma=suma+produs;
}
void back(int k)
{
if(k==m+1)
afis();
else
for(v[k]=v[k-1]+1;v[k]<=n+k-m;v[k]++)
back(k+1);
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
in>>c[i];
back(1);
out<<suma/k;
}