Submission #1190966

#TimeUsernameProblemLanguageResultExecution timeMemory
1190966emil_aliyevvBank (IZhO14_bank)C++20
19 / 100
65 ms400 KiB
#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include "bits/stdc++.h" #define int long long #define endl '\n' #define Bismillah ios_base::sync_with_stdio(0);cin.tie(0); #define indexed_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> using namespace std; using namespace __gnu_pbds; const int N = 5e5 + 7; const int INF = 1e18; const int MOD = 998244353; int n , m , a[101] , b[101]; signed main() { Bismillah; // freopen("bank.in" , "r" , stdin); // freopen("bank.out" , "w" , stdout); cin >> n >> m; cin >> a[1]; for(int i = 0; i < m; i++) { cin >> b[i]; } for(int bit = 1; bit < (1 << m); bit++) { int sum = 0; for(int i = 0; i < m; i++) { if(bit & (1 << i)) sum += b[i]; } if(sum == a[1]) { cout << "YES" << endl; return 0; } } cout << "NO" << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...