Submission #1571227

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <list>
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
using namespace std;
typedef pair<int,int> P;
int fac(int n){
    int ans=1;
    for(int i=1;i<=n;i++){
        ans*=i;
    }
    return ans;
}
int main(void){
    int n;
    cin>>n;
    if(n>=9)return 0;
    int c[101];
    for(int i=0;i<n;i++){
        cin>>c[i];
    }
    sort(c,c+n);
    int cnt=0;
    int bunbo=0;
    do{
        bool coin[8];
        for(int i=0;i<n;i++)coin[i]=true;
        for(int i=0;i<n-1;i++){
            for(int j=i+1;j<n;j++){
                if(c[j]%c[i]==0)coin[j]^=true;
            }
        }
        //for(int i=0;i<n;i++)cout<<coin[i]<<" ";
        cout<<endl;
        for(int i=0;i<n;i++){
            if(coin[i])cnt++;
        }
        bunbo++;
    }while(next_permutation(c,c+n));
    double ans=(double)cnt/bunbo;
    printf("%lf\n",ans);
    return 0;
}

Submission Info

Judge Result