Submission #1762509

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <string>
#include <algorithm>
#include <climits>
#include <set>
#include <queue>
#include <unordered_set>
using namespace std;

#define ll long long

const ll mod = 1e9 + 7;

class Solver
{
private:
	ll n;
	vector<ll> a;
	vector<bool> check;
public:
	Solver();
	void exec();
};

Solver::Solver(){
	cin >> n;

	a.push_back(0);
	check.push_back(true);
	for (int i = 0; i < n; ++i)
	{
		ll tmp;
		cin >> tmp;
		a.push_back(tmp);
		check.push_back(true);
	}

}

void Solver::exec(){
	for (int i = n; i > 0; i--)
	{
		ll sum1 = 0;
		ll sum2 = 0;
		for (int j = 1; j <= n; ++j)
		{
			if(check[j] == true) sum1 += a[j]; // わらない
			if(check[j] == true && j % i != 0) sum2 += a[j]; // わる
		}
		if(sum1 <= sum2) {
			for (int j = 1; j <= n; ++j)
			{
				if(j % i == 0) check[j] = false;
			}
		}
	}
	ll ans = 0;
	for (int i = 0; i <= n; ++i)
	{
		if(check[i] == true) ans += a[i];
	}
	if(ans < 0) {
		cout << 0 << endl;
		return;
	}
	cout << ans << endl;
}

int main(){
	Solver solution = Solver();
	solution.exec();
}

Submission Info

Judge Result