Submission #2122804

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)
#define allof(a) (a).begin(),(a).end()
template< typename T > using Vec = vector< T >;
typedef long long lint;

int N;
lint a[102];

void solve() {
	while (1) {
		lint min_sum = 0, use_x = -1;
		for_rev(x,N,1) {
			lint sum = 0;
			for_(j,1,N+1) if (j % x == 0) sum += a[j-1];
			if (min_sum > sum) {
				min_sum = sum;
				use_x = x;
			}
		}
		if (use_x != -1) {
			for_(j,1,N+1) if (j % use_x == 0) a[j-1] = 0;
		} else {
			break;
		}
	}
	cout << accumulate(a, a + N, lint()) << endl;
}

int main() {
	cin >> N;
	for_(i,0,N) cin >> a[i];
	solve();
}

Submission Info

Judge Result