UVa 160 -Factors and Factorials

就是求num！中对从2开始的每个素数的指数幂是多少，然后输出指数。注意输出格式

/*************************************************************************
    > File Name: 160.cpp
    > Author: Toy
    > Mail: ycsgldy@163.com 
    > Created Time: 2013年06月09日 星期日 20时27分49秒
 ************************************************************************/

#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;

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 );
}

int get_powers ( int n, int p ) {
	int res = 0; for ( int power = p; power <= n; power *= p ) res += n/power; return res;
}

int Case, num;

int main ( ) {
	prime_sieve();
	while ( scanf ( "%d", &num ) == 1 ) {
		if ( !num ) break;
		printf ( "%3d! =", num );
		int cnt = 0;
		For ( IV, it, primes ) {
			int tmp = get_powers ( num, *it );
			if ( tmp != 0 ) {
			   if ( cnt < 15 ) printf ( "%3d", tmp ), cnt++;
			   else printf ( "\n      %3d", tmp ), cnt = 0;
			}
			else break;
		}
		printf ( "\n" );
	}
    return 0;
}