CF1208G.Polygons

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given two integers $n$ and $k$ .

You need to construct $k$ regular polygons having same circumcircle, 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.

首页