HDU-6195 - cable cable cable - 思维

链接:

  http://acm.hdu.edu.cn/showproblem.php?pid=6195

---

题目：

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.

---

题意：

  给你n个屏幕，以及m个信号源，想让一个屏幕播放一种信号源需要一根电缆，然后让你在n个屏幕中选m个屏幕，使得每个屏幕播放的是不同的信号源，问最少要多少根电缆才能达成这个条件。

---

思路：

  我们想要达成这个条件，就是让其中m个屏幕对应m个信号源，每个用一根电缆连接，剩下的因为要满足要求，所以要每个屏幕都要与每个信号源相连，所以剩下的每个屏幕要m个电缆。

---

实现：

#include <cstdio>
int main() {
    long long n, m;
    while(~scanf("%lld%lld",&n, &m)) printf("%lld\n", (n-m+1)*m);
    return 0;
}