Submission #169288


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
  int N;
  while (cin >> N) {
    double sum = 1.0;
    vector<long long> C(N), idx(N);
    for (int i = 0; i < N; ++i) {
      cin >> C[i];
      idx[i] = i;
      sum *= (i+1);
    }

    if (N > 8) {
      cout << "0" << endl;
      continue;
    }

    long long cnt = 0LL;
    do {
      for (int i = N-1; i >= 0; --i) {
        int flip = 0;
        for (int j = i-1; j >= 0; --j) {
          if (C[idx[i]] % C[idx[j]] == 0) {
            ++flip;
          }
        }
        if (flip % 2 == 0) {
          ++cnt;
        }
      }
    } while (next_permutation(idx.begin(), idx.end()));

    printf("%.8f\n", cnt / sum);

  }
  return 0;
}

Submission Info

Submission Time
Task C - コイン
User yuta1024
Language C++ (G++ 4.6.4)
Score 99
Code Size 802 Byte
Status WA
Exec Time 43 ms
Memory 932 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 0 / 1
Status
AC × 3
AC × 20
AC × 20
WA × 20
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 21 ms 924 KB
sample_02.txt AC 21 ms 804 KB
sample_03.txt AC 20 ms 804 KB
subtask1_01.txt AC 21 ms 796 KB
subtask1_02.txt AC 24 ms 920 KB
subtask1_03.txt AC 21 ms 804 KB
subtask1_04.txt AC 41 ms 800 KB
subtask1_05.txt AC 43 ms 732 KB
subtask1_06.txt AC 22 ms 800 KB
subtask1_07.txt AC 39 ms 800 KB
subtask1_08.txt AC 21 ms 928 KB
subtask1_09.txt AC 21 ms 752 KB
subtask1_10.txt AC 40 ms 812 KB
subtask1_11.txt AC 21 ms 804 KB
subtask1_12.txt AC 39 ms 800 KB
subtask1_13.txt AC 21 ms 812 KB
subtask1_14.txt AC 22 ms 924 KB
subtask1_15.txt AC 40 ms 800 KB
subtask1_16.txt AC 39 ms 808 KB
subtask1_17.txt AC 40 ms 808 KB
subtask1_18.txt AC 40 ms 808 KB
subtask1_19.txt AC 40 ms 796 KB
subtask1_20.txt AC 40 ms 800 KB
subtask2_01.txt WA 21 ms 804 KB
subtask2_02.txt WA 20 ms 676 KB
subtask2_03.txt WA 21 ms 676 KB
subtask2_04.txt WA 21 ms 804 KB
subtask2_05.txt WA 20 ms 924 KB
subtask2_06.txt WA 24 ms 928 KB
subtask2_07.txt WA 21 ms 804 KB
subtask2_08.txt WA 21 ms 704 KB
subtask2_09.txt WA 20 ms 676 KB
subtask2_10.txt WA 21 ms 804 KB
subtask2_11.txt WA 21 ms 920 KB
subtask2_12.txt WA 21 ms 812 KB
subtask2_13.txt WA 21 ms 928 KB
subtask2_14.txt WA 20 ms 796 KB
subtask2_15.txt WA 20 ms 928 KB
subtask2_16.txt WA 21 ms 932 KB
subtask2_17.txt WA 20 ms 676 KB
subtask2_18.txt WA 20 ms 804 KB
subtask2_19.txt WA 21 ms 928 KB
subtask2_20.txt WA 20 ms 756 KB