| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1089150 | vjudge1 | Bank (IZhO14_bank) | C++17 | 2 ms | 360 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.
/**
 *    data : 09.07.2024  
 *     
**/
#include <bits/stdc++.h>
// #include "algo/turnikmen.h"
using namespace std;
#define int long long
#define bitt __builtin_popcountll
#define bitzero __builtin_clz
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
void fReopen () {
        #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        #endif
}
const int N = 2e5 + 4;
int n, m, a[N], b[N], ok, x, used[N]; 
void solve (int id, int res) {
        if (res > x) return;
        used[res] = 1;
        for (int i = id; i < m; i++) {
                solve(i + 1, b[i] + res);
        }
}
signed main (/*  time : 9:17 AM   */) {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        fReopen();
        cin >> n >> m; 
        cin >> x;
        for (int i = 0; i < m; i++) cin >> b[i];
        for (int i = 0; i < m; i++) solve(i + 1, b[i]);
        // solve(0, 0);
        
        cout << (used[x] ? "YES\n" : "NO\n");
}
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... | ||||
