数字不一定是按照升序输入的
坑死老子了!!
最后一个测试点可能段错误,把Hash数组开大点就好了,1000不够,开10000。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool cmp(int a, int b){
return a>b;
}
int main(){
int n,m;
int a[110];
scanf("%d",&n);
bool Hash[10005] = {0};
for(int i = 0;i < n;i++){
scanf("%d",&a[i]);
m = a[i];
while(m != 1){
if(m & 1) m = (3 * m + 1) / 2;
else m >>= 1;
Hash[m] = true;
}
}
int count=0;
for(int i = 0;i < n;i++){
if(Hash[a[i]] == false)
count++;
}
sort(a,a+n,cmp);
for(int j = 0; j < n;j++){
if(Hash[a[j]] == false){
printf("%d",a[j]);
count--;
if(count != 0) printf(" ");
}
}
printf("\n");
return 0;
}