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.
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.
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.
5 1
10 10
3 2
1 1
6 3
3 6
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.
解析
数学题,推公式。
max是一个组分尽量多的人,其余的组都是一个人一个组。min是将所有人尽量平均地分到每一个组中。
#include<cstdio>
using namespace std;
long long N,M;
int main()
{
scanf("%d%d",&N,&M);
long long ans=0;
//min
ans=(N/M)*(N/M-1)/2*(M-N%M);
ans+=(N/M+1)*(N/M)/2*(N%M);
printf("%I64d ",ans); ans=0;
//max
ans=(N-M+1)*(N-M)/2;
printf("%I64d",ans);
return 0;
}