不重复随机生成数

 

FILE *pw;

FILE *pf;

vector<int > vect;

 

 

pf=fopen("num.txt","w+t");

pw=fopen("排序.txt","w+t");

 

int tatol;

tatol=1000000;

 

 

int *sequence = new int[tatol];

int *output = new int[tatol];

 

for (int j = 0; j < tatol; j++)

{

sequence[j] = j;

}

 

srand((unsigned)time(NULL));

int end = tatol - 1;

 

for (int i = 0; i < tatol; i++)

{

int num = rand()%(end+1);

output[i] = sequence[num]; 

sequence[num] = sequence[end];

end--;

}

 

for (int k=0;k<tatol;k++)

{

vect.push_back(output[k]);

fprintf(pf,"%d/n",output[k]);

}

 

stable_sort(vect.begin(), vect.end(),less<int>());

vector<int>::iterator iter;

for (iter=vect.begin();iter!=vect.end();iter++)

{

fprintf(pw,"%d/n",*iter);

}

fclose(pw);

fclose(pf);

参考资料：http://www.cnblogs.com/eaglet/archive/2011/01/17/1937083.html