[洛谷]数学问题-集合求和

 P2415 集合求和 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include<iostream>
using namespace std;
#include<math.h>
int a[31];
int main()
{
	int i = 0;
	while (cin >> a[i++]);

	long long c = 0;

	for (int j = 0; j < i-1; j++)
	{
		c += a[j];
	}

	c *= pow(2, i - 2);
	cout << c;
	
}

//1 2 3 4
//1 2 1 3 1 4
//2 3 2 4 3 4
//1 2 3 1 2 4 
//1 3 4 2 3 4
//1 2 3 4
//
//
//1  8
//2  8
//3  8
//
//
//2 3
//
//2 3 2 3
//
//2 2
//3 2