UVa 10392 - Factoring Large Numbers

就是质数分解，和以前做的没什么区别，只改用long long就可以

/*************************************************************************
    > File Name: 10392.cpp
    > Author: Toy
    > Mail: ycsgldy@163.com 
    > Created Time: 2013年06月03日 星期一 08时05分59秒
 ************************************************************************/

#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<long long, long long> 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 = 1000000;
const int SQRP = 1000; //sqrt(MAX)
int _c[(MAXP>>6)+1];
IV primes;
IIV opt;

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 prime_factorize ( i64 n, IIV &f ) {
	opt.clear();
	i64 sn = sqrt ( n );
	For ( IV, it, primes ) {
		i64 prime = *it;
		if ( prime > sn ) break; if ( n % prime ) continue;
		i64 e = 0; for ( ; n % prime == 0; e++, n /= prime ) ;
		f.push_back ( II ( prime, e ) );
		sn = sqrt ( n );
	}
	if ( n > 1 ) f.push_back ( II ( n, 1 ) );
}

i64 Case;

int main ( ) {
	prime_sieve ( );
	while ( scanf ( "%lld", &Case ) == 1 ) {
		if ( Case < 0 ) break;
		prime_factorize ( Case, opt );
		For ( IIV, it, opt ) {
			for ( int i = 0; i < it -> second; ++i ) 
			    printf ( "    %lld\n", it -> first );
		}
		printf ( "\n" );
	}
    return 0;
}