[BOJ] 1182번 부분수열의 합

#include < iostream >
#include < vector >
#include < algorithm >

using namespace std;

int main()
{
    int n,m;
    cin>>n>>m;

    vector q;

    for(int i=0;i<n;i++){
        int temp;
        cin>>temp;
        q.push_back(temp);
    }

    int caseNum=0;
    for(int i=1;i<=n;i++){
        vector ind;

        for(int j=0;j<n;j++){
            if(j<i){
                ind.push_back(1);
            }else{
                ind.push_back(0);
            }
        }

        do{
            int sum=0;

            for(int k=0;k<ind.size();k++){
                if(ind[k] == 1)
                {
                    sum += q[k];
                }
            }
            if(sum == m){
                caseNum++;
            }

        }while(prev_permutation(ind.begin(),ind.end()));

        ind.clear();
    }

    cout<<caseNum;

    return 0;
}

 

https://www.acmicpc.net/problem/1182

1182번: 부분수열의 합