Submission #169673


Source Code Expand

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

int main()
{
	int N;
	vector<int> coin;
	vector<int> turn;
	vector<int> coin_buf;
	vector<bool> flag;
	double E = 0.0;
	
	cin >> N;
	coin.resize(N);
	turn.resize(N);
	flag.resize(N);
	for(int n=0; n<N; n++){
		cin >> coin[n];
	}
	
	int fact = 1;
	for(int i=1; i<=N; i++){
		fact *= i;
	}
	
	for(int NUM=0; NUM<fact; NUM++){
		coin_buf.resize(N);
		for(int i=0; i<N; i++)
			coin_buf[i] = coin[i];
		
		int BUF_NUM = NUM;
		for(int i=1; i<=N; i++){
			turn[i-1] = BUF_NUM % i;
			BUF_NUM /= i;
		}
		
		vector<int> V;
		for(int i=N-1; i>=0; i--){
			V.push_back(coin_buf[turn[i]]);
			coin_buf.erase(coin_buf.begin() + turn[i]);
		}
		
		for(int i=0; i<N; i++)
			flag[i] = true;
		
		for(int i=1; i<N; i++){
			for(int j=0; j<i; j++){
				if(V[i] % V[j] == 0)
					flag[i] = !flag[i];
			}
		}
		
		for(int i=0; i<N; i++){
			if(flag[i] == true)
				E += 1;
		}
	}
	
	printf("%.12lf\n", E/fact);
	return 0;
}

Submission Info

Submission Time
Task C - コイン
User ozamati
Language C++ (G++ 4.6.4)
Score 99
Code Size 1048 Byte
Status WA
Exec Time 2029 ms
Memory 928 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 × 17
TLE × 3
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 23 ms 804 KB
sample_02.txt AC 21 ms 928 KB
sample_03.txt AC 20 ms 920 KB
subtask1_01.txt AC 20 ms 924 KB
subtask1_02.txt AC 22 ms 924 KB
subtask1_03.txt AC 21 ms 920 KB
subtask1_04.txt AC 51 ms 812 KB
subtask1_05.txt AC 52 ms 676 KB
subtask1_06.txt AC 24 ms 804 KB
subtask1_07.txt AC 47 ms 800 KB
subtask1_08.txt AC 21 ms 924 KB
subtask1_09.txt AC 22 ms 928 KB
subtask1_10.txt AC 52 ms 804 KB
subtask1_11.txt AC 20 ms 920 KB
subtask1_12.txt AC 48 ms 804 KB
subtask1_13.txt AC 22 ms 916 KB
subtask1_14.txt AC 23 ms 808 KB
subtask1_15.txt AC 52 ms 800 KB
subtask1_16.txt AC 48 ms 804 KB
subtask1_17.txt AC 52 ms 804 KB
subtask1_18.txt AC 51 ms 800 KB
subtask1_19.txt AC 52 ms 924 KB
subtask1_20.txt AC 51 ms 808 KB
subtask2_01.txt TLE 2029 ms 864 KB
subtask2_02.txt TLE 2029 ms 804 KB
subtask2_03.txt TLE 2029 ms 808 KB
subtask2_04.txt WA 21 ms 808 KB
subtask2_05.txt WA 21 ms 864 KB
subtask2_06.txt WA 21 ms 920 KB
subtask2_07.txt WA 21 ms 928 KB
subtask2_08.txt WA 21 ms 924 KB
subtask2_09.txt WA 21 ms 796 KB
subtask2_10.txt WA 21 ms 928 KB
subtask2_11.txt WA 21 ms 928 KB
subtask2_12.txt WA 21 ms 804 KB
subtask2_13.txt WA 21 ms 924 KB
subtask2_14.txt WA 21 ms 804 KB
subtask2_15.txt WA 21 ms 800 KB
subtask2_16.txt WA 20 ms 796 KB
subtask2_17.txt WA 21 ms 924 KB
subtask2_18.txt WA 20 ms 920 KB
subtask2_19.txt WA 21 ms 924 KB
subtask2_20.txt WA 20 ms 796 KB