제출 #1284290

#제출 시각아이디문제언어결과실행 시간메모리
1284290limon4ick은행 (IZhO14_bank)C++20
19 / 100
64 ms580 KiB
/*#pragma GCC optimize("Ofast,no-stack-protector,unroint-loops,fast-math,O3") #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #pragma GCC optimization("unroint-loops") #pragma ("reroint") */ #include <bits/stdc++.h> using namespace std; //#define int long long #define pb push_back #define ins insert #define F first #define S second const int mod = 1e9 + 7,N = 5e5 + 100; signed main(){ //freopen("justcoding.in","r",stdin); //freopen("justcoding.out","w",stdout); std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n,m; cin >> n >> m; int x; cin >> x; int a[m + 1]; for(int i = 1;i<=m;i++) cin >> a[i]; bool ok = 0; for(int msk = 0;msk<(1 << m);msk++){ int sum = 0; for(int i = 1;i<=m;i++){ if((msk & (1 << (i - 1)))) sum+=a[i]; } if(sum==x) ok = 1; } if(ok) cout << "YES\n"; else cout << "NO\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...