Artifact ecd23a1d05cecd1528fb043abae6ec775b184a6b
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <functional>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <cstring>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;
class DivideAndShift { public:
int getLeast(int N, int M)
{
--M;
int best = 0x7fffffff;
for(int d=1; d*d<=N; ++d)
if( N%d == 0 )
{
best = min(best, divStep(N/d)+shiftDist(M%d, d));
best = min(best, divStep(d)+shiftDist(M%(N/d), N/d));
}
return best;
}
int shiftDist(int k, int P)
{
return min(k, P-k);
}
int divStep(int n)
{
int c = 0;
for(int p=2; p*p<=n; ++p)
while(n%p==0) {n/=p; ++c;}
return c + (n>1);
}
};
// BEGIN CUT HERE
#include <ctime>
double start_time; string timer()
{ ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
{ os << "{ ";
for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
void verify_case(const int& Expected, const int& Received) {
bool ok = (Expected == Received);
if(ok) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl;
cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
#define END verify_case(_, DivideAndShift().getLeast(N, M));}
int main(){
CASE(0)
int N = 56;
int M = 14;
int _ = 3;
END
CASE(1)
int N = 49;
int M = 5;
int _ = 2;
END
CASE(2)
int N = 256;
int M = 7;
int _ = 6;
END
CASE(3)
int N = 6;
int M = 1;
int _ = 0;
END
CASE(4)
int N = 77777;
int M = 11111;
int _ = 2;
END
CASE(5)
int N = 1000000;
int M = 1000000;
int _ = -1;
END
CASE(6)
int N = 1000000;
int M = 999997;
int _ = -1;
END
CASE(7)
int N = 1;
int M = 1;
int _ = 0;
END
CASE(8)
int N = 997*997;
int M = 444;
int _ = -1;
END
}
// END CUT HERE