HDU6195

　　cable cable cable

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 102    Accepted Submission(s): 89

Problem Description

Connecting the display screen and signal sources which produce different color signals by cables, then the display screen can show the color of the signal source.Notice that every signal source can only send signals to one display screen each time. 
Now you have M display screens and K different signal sources(K≤M≤232−1). Select K display screens from M display screens, how many cables are needed at least so that **any** K display screens you select can show exactly K different colors.

 

 

Input

Multiple cases (no more than 100), for each test case:
there is one line contains two integers M and K.

 

 

Output

Output the minimum number of cables N.

 

 

Sample Input

3 2 20 15

 

 

Sample Output

4 90

Hint

As the picture is shown, when you select M1 and M2, M1 show the color of K1, and M2 show the color of K2. When you select M3 and M2, M2 show the color of K1 and M3 show the color of K2. When you select M1 and M3, M1 show the color of K1.

 

 

Source

2017 ACM/ICPC Asia Regional Shenyang Online

 

//2017-09-10
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long

using namespace std;

int main()
{
    ll n, k;
    while(cin>>n>>k){
        cout<<(n-k+1)*k<<endl;
    }

    return 0;
}