| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 90891 | RAkhshon | 은행 (IZhO14_bank) | C++14 | 2 ms | 504 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>
#define ll long long
#define ld long double
#define st string
#define fr first
#define se second
#define INF 1000000000
using namespace std;
ll a[101101], dp[101101];
int main()
{
    ll n, m;
    scanf("%lld %lld", &n, &m);
    ll s;
    scanf("%lld", &s);
    for(ll i = 1; i <= m; i ++){
        scanf("%lld", &a[i]);
    }
    for(ll i = 1; i <= s; i ++){
        dp[i]=INF;
    }
    sort(a+1,a+1+m);
    for(ll j = 1; j <= m; j ++){
        for(ll i = 1; i <= s; i ++){
            if(i >= a[j] && dp[i] == INF && dp[i-a[j]] != a[j] && dp[i-a[j]]!=INF){
                dp[i]=a[j];
            }
        }
    }
    if(dp[s] == INF){
        printf("NO");
    }
    else
    {
        printf("YES");
    }
    return 0;
}
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... | ||||
