Submission #6779488
Source Code Expand
#include<bits/stdc++.h> using namespace std; double power(int a){ if( a == 0){ return 1;} else{ return a * power( a - 1);} } int main(){ int N; cin >> N; vector<int> C(N); vector<int> flip; // 0 means the coin is 表 while 1 means the coin is 裏 for(int i = 0; i < N; i++){ cin >> C[i];} vector<int> arrange(N); for(int i = 0; i < N; i++){ arrange[i] = i + 1;} double ans = 0; do{ double res = 0; flip = vector<int> (N,0); for(int i = 0; i < N; i++){ for(int j = 2; i* j < N; j++){ if( !(C[arrange[j]] % C[arrange[i]]) ){ flip[arrange[j]]++; flip[arrange[j]] %= 2;} }} for(int j = 0; j < N; j++){ if(!flip[j]){ res += j;}} ans += res;} while( next_permutation(arrange.begin(), arrange.end() )); ans /= power(N); cout << setprecision(7) << endl; return 0;}
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | youyin |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1028 Byte |
Status | RE |
Exec Time | 105 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 99 | 0 / 1 | ||||||
Status |
|
|
|
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 | RE | 99 ms | 256 KB |
sample_02.txt | RE | 99 ms | 256 KB |
sample_03.txt | RE | 99 ms | 256 KB |
subtask1_01.txt | RE | 99 ms | 256 KB |
subtask1_02.txt | RE | 100 ms | 256 KB |
subtask1_03.txt | RE | 99 ms | 256 KB |
subtask1_04.txt | RE | 98 ms | 256 KB |
subtask1_05.txt | RE | 99 ms | 256 KB |
subtask1_06.txt | RE | 99 ms | 256 KB |
subtask1_07.txt | RE | 100 ms | 256 KB |
subtask1_08.txt | RE | 99 ms | 256 KB |
subtask1_09.txt | RE | 99 ms | 256 KB |
subtask1_10.txt | RE | 99 ms | 256 KB |
subtask1_11.txt | RE | 101 ms | 256 KB |
subtask1_12.txt | RE | 98 ms | 256 KB |
subtask1_13.txt | RE | 98 ms | 256 KB |
subtask1_14.txt | RE | 99 ms | 256 KB |
subtask1_15.txt | RE | 99 ms | 256 KB |
subtask1_16.txt | RE | 98 ms | 256 KB |
subtask1_17.txt | RE | 99 ms | 256 KB |
subtask1_18.txt | RE | 99 ms | 256 KB |
subtask1_19.txt | RE | 99 ms | 256 KB |
subtask1_20.txt | RE | 101 ms | 256 KB |
subtask2_01.txt | RE | 104 ms | 256 KB |
subtask2_02.txt | RE | 98 ms | 256 KB |
subtask2_03.txt | RE | 98 ms | 256 KB |
subtask2_04.txt | RE | 99 ms | 256 KB |
subtask2_05.txt | RE | 99 ms | 256 KB |
subtask2_06.txt | RE | 101 ms | 256 KB |
subtask2_07.txt | RE | 99 ms | 256 KB |
subtask2_08.txt | RE | 99 ms | 256 KB |
subtask2_09.txt | RE | 102 ms | 256 KB |
subtask2_10.txt | RE | 100 ms | 256 KB |
subtask2_11.txt | RE | 100 ms | 256 KB |
subtask2_12.txt | RE | 102 ms | 256 KB |
subtask2_13.txt | RE | 99 ms | 256 KB |
subtask2_14.txt | RE | 102 ms | 256 KB |
subtask2_15.txt | RE | 99 ms | 256 KB |
subtask2_16.txt | RE | 100 ms | 256 KB |
subtask2_17.txt | RE | 100 ms | 256 KB |
subtask2_18.txt | RE | 103 ms | 256 KB |
subtask2_19.txt | RE | 105 ms | 256 KB |
subtask2_20.txt | RE | 100 ms | 256 KB |