Submission #1870344

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
 
const int maxn = 2e5 + 20;
 
int q, m[maxn];
ll ans;

ll f (int x)
{
	ll res = 0;
	for (int i = 1; i * i <= x; i++)
		if (x % i == 0)
			res += m[i] + (i != x/i ? m[x / i] : 0);
	return res;
}

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		int w, x;
		cin >> w >> x;
		m[w] = x;
	}
	for (int i = 1; i < maxn; i++)
		ans = max (ans, f (i));

	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result