This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const long long maxn =41;
const long long mod=1e9+7;
const long long logn=25;
long long n,m;
long long x[maxn];
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin>>n>>m;
for(long long i=0;i<n;i++)
{
cin>>x[i];
}
if(n<=22)
{
long long ans=0;
for(long long i=0;i<(1<<n);i++)
{
long long sum=0;
for(long long bit=0;bit<n;bit++)
{
if(i&(1<<bit))
{
sum+=x[bit];
}
}
if(sum<=m)
{
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |