Tricky Subset Problem

Deep Rakhasiya answered on June 3, 2022 Popularity 3/10 Helpfulness 1/10

answer Tricky Subset Problem

Tricky Subset Problem

Comment

int isPossible(long long S, long long N, long long X, long long A[])
    {
        // code here
        long long sum = S;
        long long idx = N-1 ;
        for(long long i=0; i<N ;i++)
        {
            A[i]= A[i] + sum;
            sum = sum +  A[i];
            if(A[i] >= X)
            {
                idx=i;
                break;
            }
        }
        while(idx>=0)
        {
            if(X >= A[idx])
            X = X - A[idx];
            idx--;
        }
        if( X==0 || X == S) return 1;
        return 0;
    
    }

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: practice.geeksforgeeks.org

Tags: c++ subset

Link to this answer
Share Copy Link

Contributed on Jun 03 2022

Deep Rakhasiya

0 Answers Avg Quality 2/10

Tricky Subset Problem

Contents

More Related Answers

Tricky Subset Problem

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.