# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794625 | nguyennehehe | Bank (IZhO14_bank) | C++14 | 2 ms | 340 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<bits/stdc++.h>
using namespace std;
const int N = 20;
int n, m, a[N], b[N];
void sub1() {
bool good = false;
for (int s = 1; s < (1 << m); ++s) {
int sum = 0;
for (int i = 0; i < m; ++i) {
if (s >> i & 1) sum += b[i];
}
good |= sum == a[0];
}
cout << (good ? "YES" : "NO");
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
freopen("bank.in", "r", stdin);
freopen("bank.out", "w", stdout);
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
if (n == 1) sub1();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |