zoukankan      html  css  js  c++  java
  • 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(KM2321). 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

     
     1 //2017-09-10
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 #define ll long long
     7 
     8 using namespace std;
     9 
    10 int main()
    11 {
    12     ll n, k;
    13     while(cin>>n>>k){
    14         cout<<(n-k+1)*k<<endl;
    15     }
    16 
    17     return 0;
    18 }
  • 相关阅读:
    整除理论
    洛谷P1440 求m区间内的最小值
    洛谷 P1865 A % B Problem
    CF776B Sherlock and his girlfriend
    POJ2262 Goldbach's Conjecture
    BZOJ1607: [Usaco2008 Dec]Patting Heads 轻拍牛头(筛法思想)
    质数合数相关
    CPU缓存会分为一级缓存L1、L2、L3
    mysql+redis
    IntelliJ IDEA下的使用git
  • 原文地址:https://www.cnblogs.com/Penn000/p/7502363.html
Copyright © 2011-2022 走看看