Submission #169562


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RREP(i,x) for(int i=(x);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)

int n;

main(){
	cin >> n;
	if(n > 10) return 0;
	vector<int> d(n), c(n);
	REP(i,n) cin >> d[i];
	sort(d.begin(), d.end());
	int sum=0;
	int cnt=0;
	do{
		REP(i, n){
			int f = 1;
			REP(j, i) if(d[i]%d[j]==0) f = !f;
			sum += f;
		}
		cnt ++;
	}while(next_permutation(d.begin(), d.end()));
	printf("%.10f\n", (double)sum/cnt);
	return 0;
}

Submission Info

Submission Time
Task C - コイン
User zerokugi
Language C++ (G++ 4.6.4)
Score 99
Code Size 876 Byte
Status WA
Exec Time 912 ms
Memory 920 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 0 / 1
Status
AC × 3
AC × 20
AC × 21
WA × 19
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 916 KB
sample_02.txt AC 23 ms 808 KB
sample_03.txt AC 22 ms 792 KB
subtask1_01.txt AC 23 ms 788 KB
subtask1_02.txt AC 22 ms 796 KB
subtask1_03.txt AC 22 ms 796 KB
subtask1_04.txt AC 27 ms 808 KB
subtask1_05.txt AC 28 ms 792 KB
subtask1_06.txt AC 21 ms 796 KB
subtask1_07.txt AC 29 ms 796 KB
subtask1_08.txt AC 22 ms 796 KB
subtask1_09.txt AC 21 ms 916 KB
subtask1_10.txt AC 27 ms 804 KB
subtask1_11.txt AC 22 ms 796 KB
subtask1_12.txt AC 30 ms 824 KB
subtask1_13.txt AC 21 ms 916 KB
subtask1_14.txt AC 22 ms 920 KB
subtask1_15.txt AC 25 ms 816 KB
subtask1_16.txt AC 28 ms 796 KB
subtask1_17.txt AC 28 ms 804 KB
subtask1_18.txt AC 24 ms 808 KB
subtask1_19.txt AC 28 ms 804 KB
subtask1_20.txt AC 30 ms 804 KB
subtask2_01.txt AC 912 ms 796 KB
subtask2_02.txt WA 22 ms 792 KB
subtask2_03.txt WA 23 ms 796 KB
subtask2_04.txt WA 20 ms 784 KB
subtask2_05.txt WA 23 ms 792 KB
subtask2_06.txt WA 22 ms 792 KB
subtask2_07.txt WA 21 ms 788 KB
subtask2_08.txt WA 23 ms 792 KB
subtask2_09.txt WA 21 ms 792 KB
subtask2_10.txt WA 21 ms 784 KB
subtask2_11.txt WA 19 ms 784 KB
subtask2_12.txt WA 21 ms 796 KB
subtask2_13.txt WA 22 ms 792 KB
subtask2_14.txt WA 48 ms 796 KB
subtask2_15.txt WA 19 ms 792 KB
subtask2_16.txt WA 28 ms 792 KB
subtask2_17.txt WA 19 ms 788 KB
subtask2_18.txt WA 19 ms 788 KB
subtask2_19.txt WA 20 ms 792 KB
subtask2_20.txt WA 21 ms 792 KB