# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1277979 | turali12 | Bank (IZhO14_bank) | C++20 | 1099 ms | 48664 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define pb push_back
#define rall(x) x.rbegin(),x.rend()
const int N=1e6+1,mod=998244353,MOD=1e9+7,INF=9223372036854775807;
/*bool lex(const string &a,const string &b){
if(a.size()!=b.size())
return a.size()<b.size();
return a<b;
}*/
/*bool cmp(const pair<int,int>&a,const pair<int,int>&b){
if(a.first!=b.first){
return a.first<b.first;
}
return a.second<b.second;
}*/
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
freopen("bank.in","r",stdin);
freopen("bank.out","w",stdout);
int testcasescount=1;
//cin>>testcasescount;
while(testcasescount--){
int n,m,x;
cin>>n>>m>>x;
vector<int>a(m);
for(int i=0;i<m;i++){
cin>>a[i];
}
vector<bool>dp(x+1);
dp[0]=true;
for(int i=0;i<m;i++){
for(int j=a[i];j<=x;j++){
dp[j]=dp[j-a[i]];
}
}
if(!dp[x]){
cout<<"NO";
}
else{
cout<<"YES";
}
}
}
Compilation message (stderr)
# | 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... |