Cod sursa(job #663205)
| Utilizator | Data | 17 ianuarie 2012 23:26:17 | |
|---|---|---|---|
| Problema | Dezastru | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
#include<iomanip>
using namespace std;
float s,fact=1,p;
int main(void)
{
int n,k,i;
float a[30];
fstream f("dezastru.in",ios::in),g("dezastru.out",ios::out);
f>>n>>k;
for (i=1;i<=n;i++)
f>>a[i];
do
{
p=1;
for(i=1;i<=k;i++)
p=p*a[i];
s=s+p;
}
while (next_permutation(a+1,a+n+1));
for (i=1;i<=n;i++)
fact=fact*i;
g<<fixed<<setprecision(6)<<s/fact;
}
