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.

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.

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 2people, maximum
number can be achieved if participants were split on teams of 1, 1 and 4 people.

题解：这个题首先能够通过公式推出1堆假设拆分成2堆。结果肯定是变小了。

所以要么其它堆都是1，一堆是n-m+1。要么均分。

结果非常大，要用long long。

#include <iostream>

#include <cstring>

#include <cstdio>

using namespace std;

long long kmi,kma,n,m;

int main()

{

    scanf("%I64d%I64d",&n,&m);

    long long b=n/m,c=n%m;

    kmi=c*b*(b+1)/2+(m-c)*b*(b-1)/2;

    kma=(n-m+1)*(n-m)/2;

    printf("%I64d %I64d\n",kmi,kma);

    return 0;

}