#include <stdio.h>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
 
long long N;
long long length;
 
int main(void)
{
//    freopen("B1024_input.txt", "r", stdin);
    
    cin >> N >> length;
    
    if(length > 100)
    {
        cout << "-1" << endl;
    }
    else
    {
        bool flag = false;
        long long first, last; 
        
        for(long long i = length; i <= 100; i++)
        {    
            // 나누는 수가 짝수 
            if(i % 2 == 0)
            {
                if(N % i == i/2)
                {
                    first = N/i-(i/2-1);
                    last = N/i+(i/2);
                    
                    // 음이 아닌 정수 리스트 고려
                    if(first < 0)
                    {
                        continue;
                    }
                    else
                    {
                        flag = true;
                        break;    
                    }
                }
            }    
            // 나누는 수가 양수
            else
            {
                if(N % i == 0)
                {
                    first = N/i-(i/2);
                    last = N/i+(i/2);
                    
                    // 음이 아닌 정수 리스트 고려 
                    if(first < 0)
                    {
                        continue;
                    }
                    else
                    {
                        flag = true;
                        break;    
                    }
                }
            }
        }
        
        if(flag == false)
        {
            cout << "-1" << endl;
        }
        else
        {
            for(long long i = first; i <= last; i++)
            {
                cout << i << " ";
            }
        }
    }
    
    return 0;
}
cs

+ Recent posts