제출 #1127541

#제출 시각아이디문제언어결과실행 시간메모리
1127541Haciyev12은행 (IZhO14_bank)C++20
19 / 100
54 ms328 KiB
#include "bits/stdc++.h" #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define ll long long #define pb push_back #define in insert #define F first #define S second #define vll vector<ll> #define all(v) v.begin(),v.end() #define endl '\n' #define pii pair<ll,ll> #define yes cout << "YES" << endl; #define no cout << "NO" << endl; using namespace std; const ll INF = 1e18, mod = 1e9 + 7, N = 2e5 + 5; ll gcd(ll a, ll b){ if(b == 0){ return a; } return gcd(b, a%b); } ll lcm(ll a, ll b){ return (a / gcd(a,b)) * b; } void solve(){ ll n,m; cin >> n >> m; ll a[n]; vector<ll>b(m); for(int i = 0; i < n; i++){ cin >> a[i]; } for(int i = 0; i < m; i++){ cin >> b[i]; } ll c; for(int i = 1; i <= (1 << m); i++){ c = 0; for(int j = 0; j < m; j++){ if(i & (1 << j)){ c += b[j]; } } if(c == a[0]){ yes; return; } } no; } int main() { fast; ll t = 1; // cin >> t; while(t--){ solve(); } 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...