题目:http://community.topcoder.com/stat?c=problem_statement&pm=13138&rd=15850
参考:http://apps.topcoder.com/wiki/display/tc/SRM+617
暴力法肯定是不行的,这里要使用Euler's totient函数来做,实现比较简单。
代码:
#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)
typedef pair<int, int> pii;
typedef long long llong;
typedef pair<llong, llong> pll;
#define mkp make_pair
#define FOREACH(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); ++it)
/*************** Program Begin **********************/
class MyVeryLongCake {
public:
vector <long long> getPrimeFactor(int n)
{
vector <long long> prime_factor;
int lim = floor( sqrt(n * 1.0 + 0.5) );
for (int i = 2; i <= lim; i++) {
while (n % i == 0) {
prime_factor.push_back(i);
n /= i;
}
}
if (n != 1) {
prime_factor.push_back(n);
}
return prime_factor;
}
int cut(int _n) {
int res = 0;
long long n = _n;
vector <long long> factor = getPrimeFactor(_n);
sort(factor.begin(), factor.end());
factor.erase(unique(factor.begin(), factor.end()), factor.end());
long long t = n;
long long p = 1;
for (int i = 0; i < factor.size(); i++) {
t *= (factor[i] - 1);
p *= factor[i];
}
res = n - t / p;
return res;
}
};
/************** Program End ************************/