| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1025336 | kkkkkkkk | Bank (IZhO14_bank) | C++14 | 1099 ms | 348 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;
int n, m;
int a[25], b[25];
int dobieni[1005];
void f(int poz, int zbir) {
if (poz==m) {
dobieni[zbir]++;
return;
}
f(poz+1, zbir);
f(poz+1, zbir+b[poz]);
}
int main()
{
cin >> n >> m;
for (int i=0;i<n;i++)
cin >> a[i];
for (int i=0;i<m;i++)
cin >> b[i];
f(0, 0);
if (dobieni[a[0]]) cout << "YES";
else cout << "NO";
return 0;
}| # | 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... | ||||
