A12797 | Polygons
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given two integers $n$ and $k$ .
You need to construct $k$ regular polygons having same [circumcircle](https://en.wikipedia.org/wiki/Circumscribed_circle), with distinct number of sides $l$ between $3$ and $n$ .
Illustration for the first example.You can rotate them to minimize the total number of distinct points on the circle. Find the minimum number of such points.
You need to construct $k$ regular polygons having same [circumcircle](https://en.wikipedia.org/wiki/Circumscribed_circle), with distinct number of sides $l$ between $3$ and $n$ .
Illustration for the first example.You can rotate them to minimize the total number of distinct points on the circle. Find the minimum number of such points.
输入格式
The only line of input contains two integers $n$ and $k$ ( $3 \le n \le 10^{6}$ , $1 \le k \le n-2$ ), the maximum number of sides of a polygon and the number of polygons to construct, respectively.
输出格式
Print a single integer — the minimum number of points required for $k$ polygons.
输入输出样例
输入 #1
6 2
输出 #1
6
输入 #2
200 50
输出 #2
708
In the first example, we have $n = 6$ and $k = 2$ . So, we have $4$ polygons with number of sides $3$ , $4$ , $5$ and $6$ to choose from and if we choose the triangle and the hexagon, then we can arrange them as shown in the picture in the statement.
Hence, the minimum number of points required on the circle is $6$ , which is also the minimum overall possible sets.
Hence, the minimum number of points required on the circle is $6$ , which is also the minimum overall possible sets.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted