Submission #170471

#TimeUsernameProblemLanguageResultExecution timeMemory
170471redaIce Hockey World Championship (CEOI15_bobek)C++14
10 / 100
1078 ms376 KiB
#include<bits/stdc++.h>
#define endl '\n'
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long 
#define pb push_back
#define all(x) x.begin(),x.end()
#pragma GCC optimize ("Ofast","unroll-loops")
using namespace std;
const int MOD = 1e9+7;
const int MAXN = 50;
ll  arr[MAXN];
ll  ans  = 1 ;
ll  n, m ; 
void solve(ll idx  ,  ll  sum)
{
	if(sum>m || idx>n)return ;
	if(idx==n && sum<=m)ans++;
	solve(idx+1,sum);
	solve(idx+1,sum+arr[idx]);
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m ;
    for(int i = 1 ;i <= n ;i++)cin >> arr[i];
    solve(1,0);
    cout<<ans;
    return 0 ;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...