1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=5010; long long a[N],n,ans,sum,maxv; int main() { cin>>n; for(int i=0;i<n;i++) { cin>>a[i]; } for(long long i=0;i<1<<n;i++) { bitset<5000>b(i); if(b.count()<3) { continue; } sum=0,maxv=0; for(int j=0;j<n;j++) { if(b[j]==1) { sum+=a[j]; maxv=max(maxv,a[j]); } } if(sum>maxv*2) { ans++; } } cout<<ans; return 0; }
- 1
Information
- ID
- 3009
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 10
- Tags
- (None)
- # Submissions
- 16
- Accepted
- 1
- Uploaded By