UVa 382 -Perfection

求num的所有因子的和tmp（不包括num），tmp和num的大小关系输出不同的结果。

tmp==num  输出 PERFECT

tmp>num     输出ABUNDANT

tmp<num     输出DEFICIENT

/*************************************************************************
    > File Name: 382.cpp
    > Author: Toy
    > Mail: ycsgldy@163.com 
    > Created Time: 2013年06月09日 星期日 21时19分56秒
 ************************************************************************/

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>

using namespace std;
const int INF = 0x7fffffff;
typedef pair<int,int> II;
typedef vector<int> IV;
typedef vector<II> IIV;
typedef vector<bool> BV;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned int u32;
#define For(t,v,c) for(t::const_iterator v=c.begin(); v!=c.end(); ++v)
#define IsComp(n) (_c[n>>6]&(1<<((n>>1)&31)))
#define SetComp(n) _c[n>>6]|=(1<<((n>>1)&31))
const int MAXP = 46341; //sqrt(2^31)
const int SQRP = 216; //sqrt(MAX)
int _c[(MAXP>>6)+1];
IV primes, opt;
int num;

void prime_sieve() {
	for ( int i = 3; i <= SQRP; i += 2 )
		if ( !IsComp(i) ) for ( int j = i*i; j <= MAXP; j+=i+i ) SetComp(j);
	primes.push_back ( 2 );
	for ( int i = 3; i <= MAXP; i += 2 ) if ( !IsComp(i) ) primes.push_back ( i );
}

void divisors ( int n, IV &ds ) {
	ds.clear ( );
	ds.push_back ( 1 );
	int sn = sqrt ( n );
	For ( IV, it, primes ) {
		int p = *it;
		if ( p > sn ) break;
		if ( n % p != 0 ) continue;
		IV aux ( ds.begin(), ds.end() );
		int q = 1;
		while ( n % p == 0 ) {
			q *= p; n /= p;
			For ( IV, v, ds ) aux.push_back ( *v * q );
		}
		sn = sqrt ( n ); ds = aux;
	}
	if ( n > 1 ) {
		IV aux ( ds.begin(), ds.end() );
		For ( IV, v, ds ) aux.push_back ( *v * n );
		ds = aux;
	}
}

int main ( ) {
	prime_sieve();
	printf ( "PERFECTION OUTPUT\n" );
	while ( scanf ( "%d", &num ) == 1 ) {
		if ( num == 0 ) {
			printf ( "END OF OUTPUT\n" );
			break;
		}
		divisors ( num, opt );
		int tmp = 0;
		For ( IV, it, opt ) {
			tmp += *it;
		}
		tmp -= num;
		printf ( "%5d  ", num );
		if ( tmp == num ) printf ( "PERFECT\n" );
		else if ( tmp > num ) printf ( "ABUNDANT\n" );
		else if ( tmp < num ) printf ( "DEFICIENT\n" );
	}
    return 0;
}