4fd800b3a8 2011-02-23        kinaba: #include <iostream>
4fd800b3a8 2011-02-23        kinaba: #include <sstream>
4fd800b3a8 2011-02-23        kinaba: #include <iomanip>
4fd800b3a8 2011-02-23        kinaba: #include <vector>
4fd800b3a8 2011-02-23        kinaba: #include <string>
4fd800b3a8 2011-02-23        kinaba: #include <map>
4fd800b3a8 2011-02-23        kinaba: #include <set>
4fd800b3a8 2011-02-23        kinaba: #include <algorithm>
4fd800b3a8 2011-02-23        kinaba: #include <numeric>
4fd800b3a8 2011-02-23        kinaba: #include <iterator>
4fd800b3a8 2011-02-23        kinaba: #include <functional>
4fd800b3a8 2011-02-23        kinaba: #include <complex>
4fd800b3a8 2011-02-23        kinaba: #include <queue>
4fd800b3a8 2011-02-23        kinaba: #include <stack>
4fd800b3a8 2011-02-23        kinaba: #include <cmath>
4fd800b3a8 2011-02-23        kinaba: #include <cassert>
4fd800b3a8 2011-02-23        kinaba: #include <cstring>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: typedef complex<double> CMP;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class BunnyConverter { public:
4fd800b3a8 2011-02-23        kinaba: 	vector< vector<int> > n_sqrt;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int getMinimum(int n, int z, int start, int goal)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		n_sqrt.resize(n);
4fd800b3a8 2011-02-23        kinaba: 		for(LL y=0; y<n; ++y)
4fd800b3a8 2011-02-23        kinaba: 			n_sqrt[y*y%n].push_back(int(y?y:n));
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		set<int> v;
4fd800b3a8 2011-02-23        kinaba: 		v.insert(start);
4fd800b3a8 2011-02-23        kinaba: 		vector<int> q(1,start);
4fd800b3a8 2011-02-23        kinaba: 		for(int step=0; !q.empty(); ++step)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			vector<int> qNext;
4fd800b3a8 2011-02-23        kinaba: 			for(int i=0; i<q.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				int x = q[i];
4fd800b3a8 2011-02-23        kinaba: 				if( x == goal )
4fd800b3a8 2011-02-23        kinaba: 					return step;
4fd800b3a8 2011-02-23        kinaba: 				const vector<int>& ys = next(x,z,n);
4fd800b3a8 2011-02-23        kinaba: 				for(int j=0; j<ys.size(); ++j)
4fd800b3a8 2011-02-23        kinaba: 				{
4fd800b3a8 2011-02-23        kinaba: 					int y = ys[j];
4fd800b3a8 2011-02-23        kinaba: 					if( v.insert(y).second )
4fd800b3a8 2011-02-23        kinaba: 						qNext.push_back(y);
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 			q.swap(qNext);
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return -1;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	const vector<int>& next(LL x, LL z, LL n)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		x %= n;
4fd800b3a8 2011-02-23        kinaba: 		z %= n;
4fd800b3a8 2011-02-23        kinaba: 		#define SUB(a,b) (((a)+n-(b))%n)
4fd800b3a8 2011-02-23        kinaba: 		#define MUL(a,b) ((a)*(b)%n)
4fd800b3a8 2011-02-23        kinaba: 		LL y2 = SUB(SUB(0, x), MUL(z,MUL(z,z)));
4fd800b3a8 2011-02-23        kinaba: 		return n_sqrt[int(y2)];
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: // BEGIN CUT HERE
4fd800b3a8 2011-02-23        kinaba: #include <ctime>
4fd800b3a8 2011-02-23        kinaba: double start_time; string timer()
4fd800b3a8 2011-02-23        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
4fd800b3a8 2011-02-23        kinaba:  { os << "{ ";
4fd800b3a8 2011-02-23        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
4fd800b3a8 2011-02-23        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
4fd800b3a8 2011-02-23        kinaba: void verify_case(const int& Expected, const int& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (Expected == Received);
4fd800b3a8 2011-02-23        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
4fd800b3a8 2011-02-23        kinaba:  cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
4fd800b3a8 2011-02-23        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
4fd800b3a8 2011-02-23        kinaba: #define END	 verify_case(_, BunnyConverter().getMinimum(n, z, start, goal));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	int n = 5;
4fd800b3a8 2011-02-23        kinaba: 	int z = 1;
4fd800b3a8 2011-02-23        kinaba: 	int start = 5;
4fd800b3a8 2011-02-23        kinaba: 	int goal = 3;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int n = 5;
4fd800b3a8 2011-02-23        kinaba: 	int z = 1;
4fd800b3a8 2011-02-23        kinaba: 	int start = 5;
4fd800b3a8 2011-02-23        kinaba: 	int goal = 1;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int n = 6;
4fd800b3a8 2011-02-23        kinaba: 	int z = 2;
4fd800b3a8 2011-02-23        kinaba: 	int start = 3;
4fd800b3a8 2011-02-23        kinaba: 	int goal = 4;
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int n = 7;
4fd800b3a8 2011-02-23        kinaba: 	int z = 7;
4fd800b3a8 2011-02-23        kinaba: 	int start = 7;
4fd800b3a8 2011-02-23        kinaba: 	int goal = 7;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int n = 499979;
4fd800b3a8 2011-02-23        kinaba: 	int z = 499979;
4fd800b3a8 2011-02-23        kinaba: 	int start = 499976;
4fd800b3a8 2011-02-23        kinaba: 	int goal = 3;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 249988;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int n = ;
4fd800b3a8 2011-02-23        kinaba: 	int z = ;
4fd800b3a8 2011-02-23        kinaba: 	int start = ;
4fd800b3a8 2011-02-23        kinaba: 	int goal = ;
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int n = ;
4fd800b3a8 2011-02-23        kinaba: 	int z = ;
4fd800b3a8 2011-02-23        kinaba: 	int start = ;
4fd800b3a8 2011-02-23        kinaba: 	int goal = ;
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE