8.md

Method 1(TLE)

bool find(int& sum,int N,int coins[],int i)
    {
        
        if(sum>2024 || sum<0 ) return false;
        
        if(sum!=0 && (sum %20==0 || sum%24==0 || sum==2024))
            return true;
            
        if(i==N)
           return false;
          
           
        sum+=coins[i];
        bool take=find(sum,N,coins,i+1);
        
        sum-=coins[i];
        bool ntake=find(sum,N,coins,i+1);
        
        return take|| ntake;
    }
    
    int isPossible(int N , int coins[]) 
    {
        vector<int>v;
        int ans=0,sum=0;
        
        return find(sum,N,coins,0);
        
    }