Submission #1693143

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
 
using namespace std;
 
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl  
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define C(i) cin>>i
#define C2(i,j) cin>>i>>j
#define C3(i,j,k) cin>>i>>j>>k
#define C4(i,j,k,m) cin>>i>>j>>k>>m
////////////////////////////////////////////////////////////

int solve(vector<int> &v){
  bool f[v.size()] = {};
  //omote = false
  //ura = true
  rep(i,0,v.size()){
    rep(j,i+1,v.size()){
      if(v[j]%v[i] == 0){
        if(f[j])
          f[j] = false;
        else
          f[j] = true;
      }
    }
  }
  
  int sum = 0;
  rep(i,0,v.size()){
    if(!f[i])
      sum++;
  }
  ret sum;
}

int main(){
  int n;
  cin >> n;
  vector<int> v;
  rep(i,0,n){
    int c;
    cin >> c;
    v.push_back(c);
  }

  vsort(v);
  long sum_m = 0;
  long sum_k = 0;
  do{
    sum_k++;
    sum_m += solve(v);
    printf("m:%ld k:%ld \n",sum_m , sum_k);
  }while(next_permutation(v.begin() , v.end() ));
  
  double d = (double)sum_m / sum_k;
  printf("%.15f\n",d);
  ret 0;
}

Submission Info

Judge Result