CF803C.Maximal GCD

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given positive integer number $n$ . You should create such strictly increasing sequence of $k$ positive numbers $a_{1},a_{2},...,a_{k}$ , that their sum is equal to $n$ and greatest common divisor is maximal.

Greatest common divisor of sequence is maximum of such numbers that every element of sequence is divisible by them.

If there is no possible sequence then output -1.

输入格式

The first line consists of two numbers $n$ and $k$ ( $1<=n,k<=10^{10}$ ).

输出格式

If the answer exists then output $k$ numbers — resulting sequence. Otherwise output -1. If there are multiple answers, print any of them.

输入输出样例

输入#1
```
6 3
```
输出#1
```
1 2 3
```
输入#2
```
8 2
```
输出#2
```
2 6
```
输入#3
```
5 3
```
输出#3
```
-1
```

首页