Codeworks round 802 (Div. 2) pure supplementary questions

---

Codeforces Round #802 Div. 2
I didn't play this time , Pure complement

A Optimal Path

Simple questions , You can even use a loop , But I'm afraid of exploding time , Simply push a formula

#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N = 1e4 + 10;

int n, m;
int T;

signed main()
{
    
	cin>>T;
	while(T -- ){
    
		cin >> n >> m;
		int op = 0;
		if(m % 2) op += (m + 1) / 2 + m / 2 * (m + 1);
		else op += (m + 1) * m / 2;
		
		op -= m;
		for(int i = 1; i <= n; i ++ ){
    
			op += i * m;
		}
		cout<<op<<endl;
	}
	return 0;
}