Contest Duration: - (local time) (120 minutes) Back to Home

Submission #169296

Source Code Expand

Copy
```#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>
using namespace std;
#define INF	100000000
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define lb lower_bound
#define ub upper_bound
#define SS stringstream
#define rep(i,n) for(int i = 0; i < n; i++)
#define sz(x) ((int)(x).size())
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define clr(a,b) memset((a),(b),sizeof(a))
typedef long long int ll;
typedef pair<ll, int> P;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<P> Vp;
typedef priority_queue<P, vector<P>, greater<P> > PQ;

int n;
double ans;
bool judge[10];

int main(){
scanf("%d", &n);
Vp c(n);
rep(i,n){
cin >> c[i].fi;
c[i].sec = i;
}
SORT(c);
do{
rep(i,n) judge[i] = false;
rep(i,n){
for(int j = i+1; j < n; j++){
if(c[j].fi % c[i].fi == 0) judge[j] = (judge[j]+1)%2;
}
}
rep(i,n) if(judge[i] == false) ans += 1.0;
} while(next_permutation(c.begin(), c.end()));
//printf("%0.7f\n", ans);
rep(i,n){
ans /= (double)(i+1);
}
printf("%0.7f\n", ans);

}```

Submission Info

Submission Time 2014-05-10 21:38:39+0900 C - コイン gasin C++ (G++ 4.6.4) 99 1393 Byte TLE 2031 ms 928 KB

Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:42:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
```

Judge Result

Score / Max Score 0 / 0 99 / 99 0 / 1
Status
 AC × 3
 AC × 20
 AC × 20 TLE × 8 RE × 12
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
sample_01.txt AC 21 ms 796 KB
sample_02.txt AC 22 ms 796 KB
sample_03.txt AC 21 ms 916 KB
subtask1_01.txt AC 21 ms 788 KB
subtask1_02.txt AC 21 ms 900 KB
subtask1_03.txt AC 23 ms 860 KB
subtask1_04.txt AC 46 ms 792 KB
subtask1_05.txt AC 46 ms 796 KB
subtask1_06.txt AC 24 ms 808 KB
subtask1_07.txt AC 42 ms 808 KB
subtask1_08.txt AC 22 ms 920 KB
subtask1_09.txt AC 21 ms 796 KB
subtask1_10.txt AC 45 ms 792 KB
subtask1_11.txt AC 22 ms 792 KB
subtask1_12.txt AC 42 ms 796 KB
subtask1_13.txt AC 21 ms 796 KB
subtask1_14.txt AC 24 ms 792 KB
subtask1_15.txt AC 47 ms 804 KB
subtask1_16.txt AC 42 ms 796 KB
subtask1_17.txt AC 48 ms 804 KB
subtask1_18.txt AC 48 ms 796 KB
subtask1_19.txt AC 47 ms 796 KB
subtask1_20.txt AC 47 ms 792 KB
subtask2_01.txt TLE 2030 ms 928 KB
subtask2_02.txt TLE 2030 ms 812 KB
subtask2_03.txt TLE 2030 ms 812 KB
subtask2_04.txt RE 232 ms 796 KB
subtask2_05.txt RE 239 ms 792 KB
subtask2_06.txt TLE 2031 ms 816 KB
subtask2_07.txt TLE 2030 ms 808 KB
subtask2_08.txt RE 235 ms 796 KB
subtask2_09.txt RE 244 ms 792 KB
subtask2_10.txt RE 233 ms 792 KB
subtask2_11.txt RE 233 ms 788 KB
subtask2_12.txt RE 235 ms 788 KB
subtask2_13.txt RE 235 ms 788 KB
subtask2_14.txt RE 234 ms 788 KB
subtask2_15.txt RE 233 ms 792 KB
subtask2_16.txt TLE 2030 ms 812 KB
subtask2_17.txt RE 244 ms 792 KB
subtask2_18.txt TLE 2030 ms 808 KB
subtask2_19.txt TLE 2030 ms 808 KB
subtask2_20.txt RE 238 ms 792 KB