B. Magical Calendar

A competitive eater, Alice is scheduling some practices for an eating contest on a magical calendar. The calendar is unusual because a week contains not necessarily 77 days!

In detail, she can choose any integer kk which satisfies 1≤k≤r1≤k≤r, and set kk days as the number of days in a week.

Alice is going to paint some nn consecutive days on this calendar. On this calendar, dates are written from the left cell to the right cell in a week. If a date reaches the last day of a week, the next day’s cell is the leftmost cell in the next (under) row.

She wants to make all of the painted cells to be connected by side. It means, that for any two painted cells there should exist at least one sequence of painted cells, started in one of these cells, and ended in another, such that any two consecutive cells in this sequence are connected by side.

Alice is considering the shape of the painted cells. Two shapes are the same if there exists a way to make them exactly overlapped using only parallel moves, parallel to the calendar’s sides.

For example, in the picture, a week has 44 days and Alice paints 55 consecutive days. [1] and [2] are different shapes, but [1] and [3] are equal shapes.

 

Alice wants to know how many possible shapes exists if she set how many days a week has and choose consecutive nn days and paints them in calendar started in one of the days of the week. As was said before, she considers only shapes, there all cells are connected by side.Input

The input consists of multiple test cases. The first line contains a single integer tt (1≤t≤10001≤t≤1000) — the number of test cases. Next tt lines contain descriptions of test cases.

For each test case, the only line contains two integers nn, rr (1≤n≤109,1≤r≤1091≤n≤109,1≤r≤109).Output

For each test case, print a single integer  — the answer to the problem.

Please note, that the answer for some test cases won’t fit into 3232-bit integer type, so you should use at least 6464-bit integer type in your programming language.ExampleinputCopy

5
3 4
3 2
3 1
13 7
1010000 9999999

outputCopy

4
3
1
28
510049495001

Note

In the first test case, Alice can set 1,2,31,2,3 or 44 days as the number of days in a week.

There are 66 possible paintings shown in the picture, but there are only 44 different shapes. So, the answer is 44. Notice that the last example in the picture is an invalid painting because all cells are not connected by sides.

 

In the last test case, be careful with the overflow issue, described in the output format.

---

题意： 就是给定格子的列数
让你确定一个起点，画一段连续的天数，超了就下一行
给你一个r,1<=k<=r
问最多有多少种种类的形状

思路：

当取到的k>=n时，只有1个，且之后的是重复的
当取到的k<n时，当k为多少时，就有多少个。这样合起来是个等差的求和
比如k=2和k=3，是肯定不会有重复地方的，因为列数不同。因为k<n,所以肯定至少2行，然后把上一行最前面的移到下面的后一位，这样下来有多少个就是当k为一个具体数字的时候的种类数

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5;
typedef long long LL;

int main(void)
{
	LL t;cin>>t;
	while(t--)
	{
		LL n,r;cin>>n>>r;
		if(n>r)
		{
			cout<<(1+r)*r/2<<endl;
		}
		else if(n<=r)
		{
			LL a=n-1;
			cout<<(a+1)*a/2+1<<endl;
		}
	}

return 0;
}