Submission #1165285

#TimeUsernameProblemLanguageResultExecution timeMemory
1165285GoBananas69Bank (IZhO14_bank)C++20
19 / 100
65 ms328 KiB
#include <iostream> #include <vector> #include <algorithm> #include <string> typedef long long ll; using namespace std; signed main() { cin.tie() -> sync_with_stdio(0); ll n, m; cin >> n >> m; vector<ll> a(n), b(m); for (ll &i: a) cin >> i; for (ll &i: b) cin >> i; ll x = a[0]; ll t = 1 << m; for (ll i = 0; i<t; ++i) { ll curr = 0; for (ll j = 0; j<m; ++j) { if (i & (1 << j)) curr += b[j]; } if (curr == x) { cout << "YES\n"; return 0; } } cout << "NO\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...