int check(int x) { int t = n / x; return x * x * (1 + t) * t / 2; } void solve() { cin >> n >> k; int r = n / k; int l = max(r - 8, 1ll); int mx = 0; for (int i = l;i <= r;i++) { mx = max(mx, check(i)); } cout << mx; return; }