Repository navigation
Expand file tree
/
Copy path1127.cpp
More file actions
69 lines (67 loc) · 1.5 KB
/
Copy path1127.cpp
File metadata and controls
69 lines (67 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
long long a[25];
vector<long long> v;
vector<long long> vv;
void part1(int n) {
long long sum = 0;
v.clear();
n = pow(2, n + 1);
int k = 0;
for (int i = 0; i < n; i++) {
int j = i;
k = 0;
sum = 0;
while (j > 0) {
int f = j % 2;
j = j / 2;
sum += f * a[k];
k++;
}
v.push_back(sum);
}
}
void part2(int m, int n) {
long long sum = 0;
vv.clear();
n = pow(2, n - m + 1);
int k = m;
for (int i = 0; i < n; i++) {
int j = i;
k = m;
sum = 0;
while (j > 0) {
int f = j % 2;
j = j / 2;
sum += f * a[k];
k++;
}
vv.push_back(sum);
}
}
int main() {
int tc;
scanf("%d", &tc);
for (int t = 1; t <= tc; t++) {
int i, j, k, l, n, total;
long long sum, x;
scanf("%d%lld", &n, &sum);
for (i = 0; i < n; i++) scanf("%lld", &a[i]);
i = (n - 1) / 2;
part1(i);
part2(i + 1, n - 1);
sort(v.begin(), v.end());
vector<long long>::iterator high;
total = 0;
for (i = 0; i < vv.size(); i++) {
if (vv[i] <= sum) {
x = sum - vv[i];
high = upper_bound(v.begin(), v.end(), x);
k = high - v.begin();
total += k;
}
}
printf("Case %d: %d\n", t, total);
}
return 0;
}