이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
vector < long long > vr1;
long long a[44];
long long ans,n,k;
void cnt1(long long zr,long long sm)
{
if(zr==(n/2+1))
{
vr1.push_back(sm);
return;
}
cnt1(zr+1,sm+a[zr]);
cnt1(zr+1,sm);
}
void cnt2(long long zr,long long sum)
{
if(zr==n+1)
{
ans+=(upper_bound(vr1.begin(),vr1.end(),k-sum)-vr1.begin());
return;
}
cnt2(zr+1,sum+a[zr]);
cnt2(zr+1,sum);
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>k;
for(long long i=1;i<=n;i++)
{
cin>>a[i];
}
cnt1(1,0);
sort(vr1.begin(),vr1.end());
cnt2(n/2+1,0);
cout<<ans<<"\n";
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... |