next_permutation求调(8pts)

#include<bits/stdc++.h>
using namespace std;
int a[7];
int p[7];
int main() {
	for (int i = 1; i <= 6; i++)cin >> a[i];
	set<int> s;
	for (int i = 1; i <= 6; i++) {
		for (int j = 1; j <= 6; j++) p[i] = 0;
		int cnt = 6;
		for (int j = 0; j < i; j++) {
			p[cnt--] = 1;
		}
		do {
			int sum = 0;
			for (int i = 1; i <= 6; i++) {
				if (p[i]) sum += a[i];
			}
			s.insert(sum);
		} while (next_permutation(p + 1, p + 7));
	}
	cout << "Total=" << s.size() << endl;
	return 0;
}