zoukankan      html  css  js  c++  java
  • 【CODEFORCES】 B. Random Teams

    B. Random Teams
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 11 and 4 people.


    题解:这个题首先能够通过公式推出1堆假设拆分成2堆。结果肯定是变小了。

    所以要么其它堆都是1,一堆是n-m+1。要么均分。

    结果非常大,要用long long。

    #include <iostream>
    #include <cstring>
    #include <cstdio>
    
    using namespace std;
    
    long long kmi,kma,n,m;
    
    int main()
    {
        scanf("%I64d%I64d",&n,&m);
        long long b=n/m,c=n%m;
        kmi=c*b*(b+1)/2+(m-c)*b*(b-1)/2;
        kma=(n-m+1)*(n-m)/2;
        printf("%I64d %I64d
    ",kmi,kma);
        return 0;
    }


  • 相关阅读:
    JSON的数据格式
    KMP 算法
    爬虫原理
    快速求小于N的所有素数
    对程序员最具影响的书籍
    实现下拉更新UITableView EGORefreshTableHeaderView
    温习C/C++笔记——浅谈琐碎知识点(1)
    C++内存对齐
    SQL Server 安装程序无法获取 ASPNET 帐户的系统帐户信息
    Asp.Net生命周期事件
  • 原文地址:https://www.cnblogs.com/jzssuanfa/p/6726794.html
Copyright © 2011-2022 走看看