# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098309 | vjudge1 | Bank (IZhO14_bank) | C++17 | 0 ms | 0 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.
#include<bits/stdc++.h>
using namespace std ;
int a[1000], b[1000];
int main(){
int n,m;
cin >> n >> m;
for(int i=1; i<=n ; i++){
cin >> a[i];
}
for(int i=1; i<=m; i++){
cin >> b[i];
}
int cnt=0;
for(int i=1 ;i<=n; i++){
while(next_permutation(b+1, b+m+1)){
int sum = 0;
bool k=0;
for(int h=1;h<=m;h++){
sum+=b[h];
if(sum == a[i]){
cnt++;
k=1;
for(int f=1; f<=h; f++){
b[f] = 0;
}
break;
}1
}
if(k)break;
}
}
if(cnt == n) cout << "YES";
else {
cout << "NO";
}
}