A9574 | Random Teams
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
$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.
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.
输入格式
The only line of input contains two integers $n$ and $m$ , separated by a single space ( $1<=m<=n<=10^{9}$ ) — the number of participants and the number of teams respectively.
输出格式
$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.
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.
输入输出样例
输入 #1
5 1
输出 #1
10 10
输入 #2
3 2
输出 #2
1 1
输入 #3
6 3
输出 #3
3 6
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 $2$ people, maximum number can be achieved if participants were split on teams of $1$ , $1$ and $4$ people.
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 $2$ people, maximum number can be achieved if participants were split on teams of $1$ , $1$ and $4$ people.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted