Submission #170470

#	Time	Username	Problem	Language	Result	Execution time	Memory
170470		reda	Ice Hockey World Championship (CEOI15_bobek)	C++14	0 / 100	1086 ms	376 KiB

bobek

#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 ;
	else if(idx<=n && sum<=m)ans++;
	solve(idx+1,sum+arr[idx]);
	solve(idx+1,sum);
}
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/2;
    return 0 ;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10