Submission #509922

---

Source Code Expand

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

vector<string> split(const string &str, char delim);

int main(void)
{
	// 変数宣言
	int n;
	int* a;
	long long int sum = 0;

	// 標準入力
	cin >> n;
	cin.ignore(); // 改行を飛ばす
	a = new int[n];

	string tmp;
	getline(cin, tmp);
	vector<string> tmp2 = split(tmp, ' ');
	for (int i = 0; i < n; i++){
		a[i] = stoi(tmp2[i]);
	}

	// 処理
	for (int i = 0; i < n; i++){
		
		sum += a[n - i - 1] * pow(2, i);
	}

	// 標準出力
	cout << sum << endl;

	return 0;
}

// delim区切りでstring型を取り出す
vector<string> split(const string &str, char delim){
	vector<string> res;
	size_t current = 0, found;
	while ((found = str.find_first_of(delim, current)) != string::npos){
		res.push_back(string(str, current, found - current));
		current = found + 1;
	}
	res.push_back(string(str, current, str.size() - current));
	return res;
}

Submission Info

Judge Result