B1005 继续（3n＋1）猜想

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int a[10005]={0};
int main(){
	int i=0,j=0,k=0,n=0,m[105]={0},x[105]={0},y=0,z=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&m[i]);}
	for(i=0;i<n;i++){
		z=m[i];
		while(z!=1){
			if(z%2==0){z/=2;a[z]++;}
			else {z=(3*z+1)/2;a[z]++;}
				//if(y==5) printf("%d",k);//²âÊÔ 	
	}}
	for(i=0;i<n;i++){
		if(a[m[i]]==0) x[j++]=m[i];
	}
	sort(x,x+j,cmp);
	for(i=0;i<j;i++){
		printf("%d",x[i]);
		if(i!=j-1) printf(" ");
	}
	return 0;
}