#include <stdio.h>
double p[20],d[20],s[1<<20],t,ans;
int main(){
int i,j,n,m;
scanf("%d",&n);
for(i=0;i<n;++i)scanf("%lf%lf",p+i,d+i),p[i]/=100;
for(i=0;i<(1<<n);++i){
m=__builtin_popcount(i);
for(j=0;j<n;++j)if(!(i&(1<<j)))s[i|(1<<j)]+=(p[j]*d[j]+(1-p[j])*s[i])/(m+1);
if(ans<s[i])ans=s[i];
}
printf("%.8lf",ans);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9276 KB |
Output is correct |
2 |
Correct |
0 ms |
9276 KB |
Output is correct |
3 |
Correct |
0 ms |
9276 KB |
Output is correct |
4 |
Correct |
0 ms |
9276 KB |
Output is correct |
5 |
Correct |
0 ms |
9276 KB |
Output is correct |
6 |
Correct |
0 ms |
9276 KB |
Output is correct |
7 |
Correct |
0 ms |
9276 KB |
Output is correct |
8 |
Correct |
0 ms |
9276 KB |
Output is correct |
9 |
Correct |
0 ms |
9276 KB |
Output is correct |
10 |
Correct |
0 ms |
9276 KB |
Output is correct |
11 |
Correct |
0 ms |
9276 KB |
Output is correct |
12 |
Correct |
0 ms |
9276 KB |
Output is correct |
13 |
Correct |
0 ms |
9276 KB |
Output is correct |
14 |
Correct |
0 ms |
9276 KB |
Output is correct |
15 |
Correct |
0 ms |
9276 KB |
Output is correct |
16 |
Correct |
0 ms |
9276 KB |
Output is correct |
17 |
Correct |
0 ms |
9276 KB |
Output is correct |
18 |
Correct |
0 ms |
9276 KB |
Output is correct |
19 |
Correct |
0 ms |
9276 KB |
Output is correct |
20 |
Correct |
0 ms |
9276 KB |
Output is correct |
21 |
Correct |
0 ms |
9276 KB |
Output is correct |
22 |
Correct |
0 ms |
9276 KB |
Output is correct |
23 |
Correct |
0 ms |
9276 KB |
Output is correct |
24 |
Correct |
0 ms |
9276 KB |
Output is correct |
25 |
Correct |
0 ms |
9276 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
116 ms |
9276 KB |
Output is correct |
2 |
Correct |
120 ms |
9276 KB |
Output is correct |
3 |
Correct |
124 ms |
9276 KB |
Output is correct |
4 |
Correct |
121 ms |
9276 KB |
Output is correct |
5 |
Correct |
123 ms |
9276 KB |
Output is correct |
6 |
Correct |
120 ms |
9276 KB |
Output is correct |
7 |
Correct |
121 ms |
9276 KB |
Output is correct |
8 |
Correct |
124 ms |
9276 KB |
Output is correct |
9 |
Correct |
124 ms |
9276 KB |
Output is correct |
10 |
Correct |
124 ms |
9276 KB |
Output is correct |
11 |
Correct |
116 ms |
9276 KB |
Output is correct |
12 |
Correct |
120 ms |
9276 KB |
Output is correct |
13 |
Correct |
124 ms |
9276 KB |
Output is correct |
14 |
Correct |
124 ms |
9276 KB |
Output is correct |
15 |
Correct |
124 ms |
9276 KB |
Output is correct |
16 |
Correct |
121 ms |
9276 KB |
Output is correct |
17 |
Correct |
120 ms |
9276 KB |
Output is correct |
18 |
Correct |
125 ms |
9276 KB |
Output is correct |
19 |
Correct |
122 ms |
9276 KB |
Output is correct |
20 |
Correct |
120 ms |
9276 KB |
Output is correct |