cf478B-Random Teams 【排列组合】

http://codeforces.com/problemset/problem/478/B

B. Random Teams

 

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.

 

 

题解：最小值：均分。最大值：(m-1)个team每个分1个participant，另一个team分(n-(m-1))个participant。

代码：

 1 #include <fstream>

 2 #include <iostream>

 3 

 4 using namespace std;

 5 

 6 const int N=1000000005;

 7 

 8 inline __int64 num(int nn){

 9     return (__int64)nn*(nn-1)>>1;

10 }

11 

12 int main(){

13     //freopen("D:\\input.in","r",stdin);

14     //freopen("D:\\output.out","w",stdout);

15     int n,m;

16     scanf("%d%d",&n,&m);

17     if(n==m)    puts("0 0");

18     else{

19         int l=n/m,r=n%m;

20         printf("%I64d %I64d\n",num(l+1)*r+num(l)*(m-r),num(n-m+1));

21     }

22     return 0;

23 }