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>
#define imie(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
vector<vector<int>> gen(const vector<int>& a, int n){
vector<vector<int>> podzbiory;
for(int maska = 0; maska < (1 << n); maska++){
vector<int> podzbior;
for(int i = 0; i < n; i++){
if(maska & (1 << i)){
podzbior.push_back(a[i]);
}
}
sort(podzbior.begin(), podzbior.end());
podzbiory.push_back(podzbior);
}
return podzbiory;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
int x;
cin >> x;
vector<int> v(m);
for(int i = 0; i < m; i++) {
cin >> v[i];
}
vector<vector<int>> a = gen(v, m);
bool ans = false;
for(auto &podzbior : a) {
int S = 0;
for(auto &i : podzbior) {
S += i;
}
if(S == x) {
ans = true;
break;
}
}
cout << (ans ? "YES" : "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... |