【Codeforces 803 C. Maximal GCD】

C. Maximal GCD
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a1, a2, …, ak, 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.
Input
The first line consists of two numbers n and k (1 ≤ n, k ≤ 1010).
Output
If the answer exists then output k numbers — resulting sequence. Otherwise output -1. If there are multiple answers, print any of them.
Examples
Input
6 3
Output
1 2 3
Input
8 2
Output
2 6
Input
5 3
Output
-1

n = 1 * q + 2 * q +….+m * q;

1) n % q == 0

2）要保证 n / q >= (1 + k) * k / 2

3) q要尽可能大

AC代码：

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
const LL MAX = (1 << 31) - 1;
int main()
{
    LL n,k;
    scanf("%lld %lld",&n,&k);
    LL p = k * (k + 1) / 2;
    if(n < p || k > MAX) // 可能会爆 LL
        puts("-1");
    else{
        LL a = 1;
        for(LL i = 1; i * i <= n; i++)
            if(n % i == 0){
                LL o = n / i;
                if(o >= p)
                    a = max(a,i);
                if(i >= p)
                    a = max(a,o);
                }
        LL o = n / a;
        for(LL i = 1; i < k; i++)
            printf("%lld ",i * a),o -= i;
        printf("%lld\n",a * o);
    }
    return 0;
}