Codeforces Round#478--Random Teams

                                                                         

B. Random Teams

time limit per test

 1 second

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

n participants of the competition were split into m teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.

Your task is to write a program that will find the minimum and the maximum number of pairs of friends that could have formed by the end of the competition.

Input

The only line of input contains two integers n and m, separated by a single space (1 ≤ m ≤ n ≤ 109) — the number of participants and the number of teams respectively.

Output

The only line of the output should contain two integers kmin and kmax — the minimum possible number of pairs of friends and the maximum possible number of pairs of friends respectively.

Sample test(s)

input

5 1

output

10 10

input

3 2

output

1 1

input

6 3

output

3 6

Note

In the first sample all the participants get into one team, so there will be exactly ten pairs of friends.

In the second sample at any possible arrangement one team will always have two participants and the other team will always have one participant. Thus, the number of pairs of friends will always be equal to one.

In the third sample minimum number of newly formed friendships can be achieved if participants were split on teams consisting of 2 people, maximum number can be achieved if participants were split on teams of 1, 1 and 4 people.

题意：n个人，分成m个队，每个队至少一人。其中每组中两两成为朋友，求n个人，最少和最多可以组成多少队朋友？

           最少：n个人平均分到m个队伍，此时组成的朋友数最少。需要注意的是，当n%m不为0时，把剩下的人，再平分到每个组才会使朋友数更少，而不应该把剩下的人直接放到其中一个队伍中。

           最多：n个人，其中m-1个队，队中只有一个人，剩下的人都放在一个组里，此时可以成为的朋友数最多。

算法：排列组合问题，例如，n个人在同一个队伍里，可以组成的朋友数为 [n(n-1)]/2。

#include<stdio.h>
#include<string.h>
#include<cmath>
int main()
{
	long long maxx, minn, n, m;
	long long t1;
	scanf("%lld%lld", &n, &m);
	t1 = n/m;
	if(n%m==0){
		minn = m*(t1*(t1-1)/2);
	}
	else{
		minn = (n%m)*(t1+1)*(t1)/2 +(m-n%m)*t1*(t1-1)/2;
	}
	maxx = (n-m+1)*(n-m)/2;

	printf("%lld %lld\n",  minn, maxx);

	return 0;
}