Cod sursa(job #596584)
| Utilizator | Data | 17 iunie 2011 19:40:16 | |
|---|---|---|---|
| Problema | Dezastru | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<cstdio>
#define NMax 28
using namespace std;
int n,k;
double a[NMax],suma;
int numar;
void Back(int pas,int x,double p)
{
if(pas==k)
{
suma+=p;
numar++;
return;
}
for(int i=x+1;i<=n-k+pas;i++)
Back(pas+1,i,p*a[i]);
}
int main()
{
int i;
freopen("dezastru.in","r",stdin);
freopen("dezastru.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=0;i<n;i++)
scanf("%lf",a+i);
Back(0,-1,1);
printf("%.6lf\n",suma/numar);
return 0;
}
