C. Maximal GCD(思维+数学)

https://codeforces.com/problemset/problem/803/C

---

https://blog.csdn.net/weixin_43944486/article/details/102446043?utm_medium=distribute.pc_relevant.none-task-blog-baidujs_title-4&spm=1001.2101.3001.4242

/*
    设最后选出来的k个数字为
    a[1],a[2]...a[k];
    这些数字的最大公因数为g
    g*b[1],g*b[2],...g*b[k]
    n=g*b[1]+g*b[2]+...+g*b[k];
    这里g必然是n的因子;
    且
    n/g==b[1]+b[2]+..+b[k]>=1+2+3...+k···①
    (1+2+3..+k 是最小的满足严格递增的长度为k的序列)
    构造最后的答案为
    1*g,2*g,3*g...(k-1)*g以及n-(1+2+3..k-1)*g
    前k-1项肯定是递增的;
    而由①式可知
        n-g*(1+2+3..+k)>=0
        则
        最后一项=n-g*(1+2+3..+k-1)>=g*k
    所以也是单调递增的;
    这里只要保证①式成立,就肯定能找到解了
    (1+2+...+k如果大于1e10直接输出无解就好,这样防止爆LL)
    有解就从大到小枚举n的因子,找到第一个符合的输出就好
*/

 

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
bool cmp(LL A,LL B){return A>B;}
void pri(LL x,LL k,LL n){
    LL temp=n;
    for(LL i=1;i<=k-1;i++){
        cout<<i*x<<" ";
        temp-=i*x;
    }
    cout<<temp<<"\n";
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,k;cin>>n>>k;
   if(k>=1e6) {cout<<"-1"<<"\n";return 0;}
   LL sum=(1+k)*k/2;
   vector<LL>v;
   LL res=n;
   for(LL i=1;i<=sqrt(res);i++){
       if(res%i==0){
          if(i*i==res){
             v.push_back(i);
          }
          else v.push_back(i),v.push_back(res/i);
       }
   }
   bool flag=1;
   sort(v.begin(),v.end(),cmp);
   for(auto i:v){
       if(n/i>=sum){
           pri(i,k,n);
           flag=0;
           break;
       }
   }
   if(flag){
      cout<<"-1"<<"\n";
   }
   return 0;
}