제출 #118777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118777		silxikys	Ice Hockey World Championship (CEOI15_bobek)	C++14	20 / 100	64 ms	512 KiB

bobek

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

const int maxn = 45;

int N, M;
ll A[maxn], B[maxn];

int main()
{
	cin >> N >> M;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
    ll ans = 0;
	for (int i = 0; i < (1<<N); i++) {
        ll total = 0;
        for (int j = 0; j < N; j++) {
            if (i & (1<<j)) total += A[j];
        }
        if (total <= M) ans++;
    }
    cout << ans << '\n';
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 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