【CODEFORCES】 B. 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 2people, maximum number can be achieved if participants were split on teams of 1, 1 and 4 people.
문제풀이: 이 문제는 우선 공식을 통해 한 무더기를 내놓을 수 있다. 만약 두 무더기로 나누면 결과는 틀림없이 작아질 것이다.그래서 다른 무더기는 모두 1, 한 무더기는 n-m+1, 아니면 균등하게 나눈다.
결과는 매우 커서 롱롱을 써야 한다.

#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
",kmi,kma);
    return 0;
}