Pagini recente » Cod sursa (job #2908243) | Cod sursa (job #258687) | Cod sursa (job #709313) | Cod sursa (job #1197818) | Cod sursa (job #2594689)
#include<bits/stdc++.h>
using namespace std;
float n,k,p[35],x[30],suma=0,ans=0;
int ok(int k1){
for(int i=1;i<k1;i++){
if(x[i]==x[k1])return 0;
}
return 1;
}
void calc(){
float prob=1;
for(int i=1;i<=k;i++){
prob*=x[i];
}
suma+=prob;
}
void permutari(int k1){
for(int i=1;i<=n;i++){
x[k1]=p[i];
if(ok(k1)){
if(k1==k){
calc();ans++;
}
else permutari(k1+1);
}
}
}
int main(){
ifstream cin("dezastru.in");
ofstream cout("dezastru.out");
cin>>n>>k;
for(int i=1;i<=n;i++)cin>>p[i];
permutari(1);
cout<<suma/ans;
}