Any other method without sets?

luG_0 · July 5, 2019, 9:55am

gist.github.com

https://gist.github.com/LuGO0/230f9854c18a58661d9120353d1b4a27

SumItUpUsingSets.cpp

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<string>

typedef long long ll;
using namespace std;

bool marker[17]{ false };

This file has been truncated. show original

I did it with Sets any idea on how to do it without sets.

apaarkamal · July 5, 2019, 12:25pm

yes ,you can take out all the subsequences using bitmasking or recursion , your wish.
and for each combination you can check whether sum equals k or not.