Submission #3220806


Source Code Expand

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<set>
#include<map>
using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define ROF(i,b,a) for (int i=(b);i>(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,n-1,-1)

typedef int i32;
typedef long long int i64;
typedef unsigned long long int ui64;
typedef float f32;
typedef double f64;
typedef long double f128;
typedef pair<int,int> Pi;

constexpr int INF = 1e9 + 7;
constexpr int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};

int main() {
    int N; cin>>N;
    int C[N]; REP(i,N) cin>>C[i];
    sort(C,C+N);
    int cnt[N];  
    int z=0;
    int sum = 0;
    do {
        REP(i,N) cnt[i]=0;
        REP(i,N) {
            FOR(j,i+1,N) {
                if (C[j]%C[i]==0) {
                    cnt[j]++;
                    cnt[j] %= 2;
                }
            }
        }
        REP(i,N) if (cnt[i]%2==0) sum++;
        z++;
    } while(next_permutation(C,C+N));
    cout<<fixed<<setprecision(20)<<(f64)sum/z<<endl;
}

Submission Info

Submission Time
Task C - コイン
User semimaru
Language C++14 (GCC 5.4.1)
Score 99
Code Size 1148 Byte
Status TLE
Exec Time 2103 ms
Memory 384 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 0 / 1
Status
AC × 3
AC × 20
AC × 22
TLE × 18
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 384 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 7 ms 256 KB
subtask1_05.txt AC 7 ms 256 KB
subtask1_06.txt AC 2 ms 256 KB
subtask1_07.txt AC 6 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 7 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 6 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 5 ms 256 KB
subtask1_16.txt AC 6 ms 256 KB
subtask1_17.txt AC 9 ms 256 KB
subtask1_18.txt AC 3 ms 256 KB
subtask1_19.txt AC 8 ms 256 KB
subtask1_20.txt AC 8 ms 256 KB
subtask2_01.txt AC 715 ms 256 KB
subtask2_02.txt AC 1 ms 256 KB
subtask2_03.txt TLE 2103 ms 256 KB
subtask2_04.txt TLE 2103 ms 256 KB
subtask2_05.txt TLE 2103 ms 256 KB
subtask2_06.txt TLE 2103 ms 256 KB
subtask2_07.txt TLE 2103 ms 256 KB
subtask2_08.txt TLE 2103 ms 256 KB
subtask2_09.txt TLE 2103 ms 256 KB
subtask2_10.txt TLE 2103 ms 256 KB
subtask2_11.txt TLE 2103 ms 256 KB
subtask2_12.txt TLE 2103 ms 256 KB
subtask2_13.txt TLE 2103 ms 256 KB
subtask2_14.txt TLE 2103 ms 256 KB
subtask2_15.txt TLE 2103 ms 256 KB
subtask2_16.txt TLE 2103 ms 256 KB
subtask2_17.txt TLE 2103 ms 256 KB
subtask2_18.txt TLE 2103 ms 256 KB
subtask2_19.txt TLE 2103 ms 256 KB
subtask2_20.txt TLE 2103 ms 256 KB