C. Maximal GCD
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given positive integer number n. You shouldcreate such strictly increasing sequence of k positivenumbers a1, a2, ..., ak, that theirsum is equal to n and greatest common divisor is maximal.
Greatest common divisor of sequence is maximum of suchnumbers 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 aremultiple answers, print any of them.
Examples
input
6 3
output
1 2 3
input
8 2
output
2 6
input
5 3
output
-1
#include<stdio.h>
#include<math.h>
int main()
{
__int64 n,k,sum,i,g;
scanf("%I64d%I64d",&n,&k);
sum=(1+k)*k/2;
if(sum>n||k>1000000)
{
printf("-1\n");
}
else if(k==1)
{
printf("%I64d\n",n);
}
else
{
for(i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
if(i<=n/sum) g=i;
if(i>=sum)
{
g=n/i;
break;
}
}
}
for(i=1;i<k;i++)
{
printf("%I64d ",i*g);
n-=i*g;
}
printf("%I64d\n",n);
}
return 0;