我的思路是
把这个数所有覆盖到的数全部列出在和原vector里的数比较如果相同就把他剔除(赋值为1接下来忽略其就行)
最后输出即可
用vector自带的sort排序确实很省力
下面是AC代码
int main() {
int sum;
cin >> sum;
vector<int>v(sum);
for (int i = 0; i < sum; i++)
{
int a;
cin >> a;
v[i] = a;
}
for (int j = 0; j < v.size(); j++)
{
int a = v[j];
while (a != 1) {
if (a % 2 != 0)
a = ((a * 3) + 1) / 2;
else a = a / 2;
for (int z = 0; z < v.size(); z++)
{
if (v[z] ==a ) {
v[z] = 1;
break;
}
}
}
}
sort(v.rbegin(), v.rend());
for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
if (*it != 1) {
cout << *it ;
if (it!=(v.end()-1)&&*(it+1)!=1)
cout << " ";
}
}
system("pause");
return 0;
}