Merge pull request #383 from yashagarwal1999/master

Solved Issue Combinations #381 as powerset.cpp

Author: kannagikazuko

honorary-one-line-wonders/cplusplus/yashagarwal1999_powerset.cpp

@@ -0,0 +1,71 @@
+#include<bits/stdc++.h>
+#define endl "\n"
+#define pb push_back
+#define mp make_pair
+#define fi first
+#define se second
+#define MOD 1000000007
+#define MOD9 1000000009
+#define pi 3.1415926535
+#define ms(s, n) memset(s, n, sizeof(s))
+#define prec(n) fixed<<setprecision(n)
+#define eps 0.000001
+#define all(v) v.begin(), v.end()
+#define allr(v) v.rbegin(), v.rend()
+#define forr(i,p,n) for(ll i=p;i<n;i++)
+#define MAXN 500003
+typedef long long ll;
+inline ll mod(ll x,ll n)
+{
+    if(x<n)
+    {
+        return x;
+    }
+    return x-n;
+}
+using namespace std;
+ll mult(ll a,ll b, ll p=MOD){return ((a%p)*(b%p))%p;}
+ll add(ll a, ll b, ll p=MOD){return (a%p + b%p)%p;}
+ll fpow(ll n, ll k, ll p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n%p; n = n * n%p;} return r;}
+ll inv(ll a, ll p = MOD) {return fpow(a, p - 2, p);}
+ll inv_euclid(ll a, ll m = MOD){ll m0 = m;ll y = 0, x = 1;if (m == 1)return 0;while (a > 1){ll q = a / m;ll t = m;m = a % m, a = t;t = y;y = x - q * y;x = t;}if (x < 0)x += m0;return x;}
+
+
+
+int main(){
+    
+    
+        ios_base::sync_with_stdio(false);
+cin.tie(0);
+cout.tie(0);
+vector<ll>v;
+ ll sum=0,act=0,k,n,q,f;
+cin>>n;
+v.reserve(n);
+forr(i,0,n)
+    {
+        cin>>f;
+        v.pb(f);
+      
+    }
+ll x=(1LL<<n);
+vector<ll>arr[x];
+
+forr(i,1,x)
+{
+    for(ll j=0;j<n;j++)
+    {
+        ll p=(1LL<<j);
+        if(i & p)arr[i].pb(v[j]);
+    }
+}
+forr(i,1,x)
+{
+    forr(j,0,arr[i].size())
+    {
+        cout<<arr[i][j]<<" ";
+    }
+    cout<<endl;
+}
+return 0;
+}

python/yashagarwal1999_powerset.py

@@ -0,0 +1,7 @@
+from itertools import chain, combinations
+
+def powerset(iterable):
+    s = list(iterable)
+    return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))
+    
+print(list(powerset("abc")))