HPU 1352: 整除k的偶数 [水题]

#include <iostream>
//#include <math.h>
#include <algorithm>
using namespace std;
int main()
{
	int i,j=0,k,b[233],n;
	cin>>k;
	if(k%2==1) {
		cout<<"No"<<endl;
		exit(0);
	}
	for(i=2;i<=k;i++){
		if((k%i==0)&&(i%2==0)) { 
		   
		   b[j]=i; 
		   j++;
	}}
	sort(b,b+j);
	for(n=j-1;n>=0;n--){
		cout<<b[n]<<endl;
	}
	return 0;
}

//No与NO也是够了