Subset Sum / DP

/***
 created: 2021-10-19-17.19.48
***/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int tt; cin>>tt; for(int cs=1;cs<=tt;cs++)
#define get_lost_idiot return 0

int main()
{
   ios_base::sync_with_stdio(0);
   cin.tie(0);cout.tie(0);

   ll n,m,i,j,k,l,sum;

   cin>>n>>sum;

   ll a[n+5];

   for(i=0;i<n;i++) cin>>a[i];

   bool dp[n+1][sum+2];


   for(i=0;i<=n;i++) dp[i][0]=1;

   for(i=1;i<=sum;i++) dp[0][i]=0;

   for(i=1;i<=n;i++)
   {
        for(j=1;j<=sum;j++)
        {
             if(j<a[i-1])
             {
                  dp[i][j]=dp[i-1][j];
             }
             else
             {
                  dp[i][j]=dp[i-1][j] || dp[i][j-a[i-1]];
             }
        }
   }


   if(dp[n][sum]) cout<<"Subset sum is present"<<endl;
   else cout<<"No subset sum"<<endl;



   get_lost_idiot;
}