Pagini recente » Cod sursa (job #105865) | Monitorul de evaluare | Cod sursa (job #1771247) | Istoria paginii runda/gr_4/clasament | Cod sursa (job #1886871)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dezastru.in");
ofstream g("dezastru.out");
int n,k,o,x[26];
double h[26],va[26];
void pre()
{
int i;
double p=1;
for(i=1;i<=k;i++)
p=p*va[x[i]];
o++;
h[o]=p;
}
int bun(int i)
{
int j;
for(j=1;j<i;j++)
if(x[j]==x[i])
return 0;
return 1;
}
void back(int i)
{
while(i)
{
while(i&&i<=k)
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
if(bun(i))
i++;
}
if(i>k)
{
pre();
i=k;
}
}
}
int main()
{
double s=0;
f>>n>>k;
for(int i=1;i<=n;i++)
f>>va[i];
back(1);
for(int i=1;i<=o;i++)
s=s+(h[i]/6);
g<<s;
return 0;
}