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.
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 .
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 90HintAs 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. ![]()
【题解】
对于这道题,我只想说,,,,emmmmmm,还是不说了吧,心累,刚开始吧题读错了,结果推得公式还满足样例结果,就一直哇哇哇,最后终于拨开迷雾见真题.....
【AC代码】
#include<iostream>
#include<cstring>
#include<stdio.h>
#include<math.h>
#include<string>
#include<stdio.h>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<deque>
#include<algorithm>
using namespace std;
int main()
{
long long n,i,test,k;
while(scanf("%lld%lld",&n,&k)!=EOF)
{
printf("%lld\n",((n+1)-k)*k);
}
return 0;
}