cf1260A(div2)

差点拦住我的水题

题意:

• 给定两个数$c,sum$
• 要求至少有$c$个整数(可重复,可为0), 满足$c_1+c_2+c_3+\cdots +c_n=sum$
  $$min(\sum _{i=1}^n{c}_i^2)$$

数据范围: $n\le 10000$

>> face <<

前置技能:无

Tutorial: 枚举几个例子就会发现, 均摊所有的数是贪心的策略

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
signed main(){
	int n = nxt();
	while(n--){
		int c = nxt(), sum = nxt();
		
		
		int per = sum/c + 1;
		int x = sum - c*per + c;
		cout << per*per*(x)*1ll + (per-1)*(per-1)*(c - x)*1ll << endl;
		
	}
}