SRM 599 D2L2：BigFatInteger2, math

题目：http://community.topcoder.com/stat?c=problem_statement&pm=12870

代码：

#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iostream>
#include <sstream>
#include <iomanip>

#include <bitset>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>


using namespace std;


#define CHECKTIME() printf("%.2lf\n", (double)clock() / CLOCKS_PER_SEC)

/*************** Program Begin **********************/

class BigFatInteger2 {
public:
	map < long long, long long > extractPrimeFactors(int x)
	{
		map <long long, long long> ap;
		for (int p = 2; p * p <= x; p++) {
			int ex = 0;
			bool flag = false;
			while (x % p == 0) {
				flag = true;
				++ex;
				x /= p;
			}
			if (flag) {
				ap[p] = ex;
			}
		}
		if (x != 1) {
			ap[x] = 1;
		}
		return ap;
	}

	string isDivisible(int A, int B, int C, int D) {
		auto ap = extractPrimeFactors(A);
		auto cp = extractPrimeFactors(C);
		for (auto it = cp.begin(); it != cp.end(); it++) {
			if (ap[ (*it).first ] * B < (*it).second * D) {
				return "not divisible";
			}
		}
		return "divisible";
	}

};

/************** Program End ************************/