求一个数的所有约数

#include <iostream>
#include <cstring>
#include <algorithm>

#define maxn 100

using namespace std;

int yueShu[maxn],length;

void approximateNumber(int n){
int i;
for(i=1;i*i<n;i++){
if(n%i == 0){
yueShu[length ++] = i;
yueShu[length ++] = n/i;
}
}

if(i*i == n)
yueShu[length ++] = i;
}

void print(){
cout<<yueShu[0];
for(int i=1;i<length;i++)
cout<<" "<<yueShu[i];
cout<<endl;
}

int main(){
int n;
while(cin>>n){
memset(yueShu,0,maxn*sizeof(int));
length = 0;

approximateNumber(n);
sort(yueShu,yueShu + length);

print();
}
return 0;
}