# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169134 | LinusTorvaldsFan | Bank (IZhO14_bank) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
const int N = 20;
const int M = 14;
const int masks = 1 << M;
bool dp[masks][N];
int main() {
int n, m;
cin >> n >> m;
vector<int>a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int>b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
if (n == 1) {
for (int mask = 0; mask < (1 << m); mask++) {
int cur = 0;
for (int j = 0; j < m; j++) {
if (mask & (1 << j)) {
cur += b[j];
}
}