Backtracking

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<VS> VVS;

int n, p;
VS ps;
VVS parts;
VI is;

void print() {
  for (int i = 0; i < p; ++i) {
    cout << "subconjunt " << i+1 << ": {";
    fo r(int j = 0; j < is[i]; ++j) {
      if (j) cout << ',';
      cout << parts[i][j];
    }
    cout << "}" << endl;
  }
  cout << endl;
}

void bt(int k) {
  if (k == n) return print();
  for (int i = 0; i < p; ++i) {
    parts[i][is[i]++] = ps[k];
    bt(k+1); --is[i];
  }
}

int main() {
  cin >> n;
  ps = VS(n);
  for (int i = 0; i < n; ++i) cin >> ps[i];
  cin >> p;
  parts = VVS(p, VS(n));
  is = VI(p, 0);
  bt(0);
}