New Year and the Sphere Transmission

版权声明：来自星空计算机团队(QQ群：134826825)——申屠志刚 https://blog.csdn.net/weixin_43272781/article/details/85425646

https://codeforces.com/contest/1091/problem/C

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
ll t,n,m,k,q,ans;
char str;
ll a[N];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%I64d",&n);
    m=sqrt(n);
    int cnt=0;
    for(int i=1;i<=m;i++){
        if(n%i!=0){
            continue;
        }
        a[++cnt]=(1+n-i+1)*n/i/2;
        a[++cnt]=(1+n-n/i+1)*i/2;
    }
    sort(a+1,a+cnt+1);
    for(int it=1;it<=cnt;it++){
        if(a[it]!=a[it-1])
       printf("%I64d ",a[it]);
    }
    //cout << "Hello world!" << endl;
    return 0;
}