For this Question: Given a natural number N, your task is to print all of its unique divisors in a sorted order.Input contains a single integer N.

Constraints:-
1 < = N < = 1000000000Print the unique divisors of N from smallest to largest.Sample Input:-
6

Sample Output:-
1 2 3 6

Sample Input:-
30

Sample Input:-
1 2 3 5 6 10 15 30, I have written this Solution Code: 
// author-Shivam gupta

#include <bits/stdc++.h>


using namespace std;

#define MEM(a, b) memset(a, (b), sizeof(a))

#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)

#define IN(A, B, C) assert( B <= A && A <= C)

#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)

#define FOR1(i,j,a) for(int i=j;i<a;i++)

#define EB emplace_back

#define INF (int)1e9

#define EPS 1e-9

#define PI 3.1415926535897932384626433832795

#define MOD 1000000007

#define read(type) readInt<type>()
#define max1 100001
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
signed main(){
    fast();

    int n;
    cin>>n;
    vector<int> v;
    int x=sqrt(n);
    for(int i=1;i<=x;i++){
        if(n%i==0){v.EB(i);
        if(i*i!=n){
            v.EB(n/i);
        }}
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++){
        out1(v[i]);
    }
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?