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 LongLongNim { public:
4fd800b3a8 2011-02-23        kinaba: 	int numberOfWins(int maxN, vector <int> moves)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int FULL = (1 << *max_element(moves.begin(), moves.end())) - 1;
4fd800b3a8 2011-02-23        kinaba: 		int MASK = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<moves.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 			MASK |= 1 << (moves[i]-1);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		vector<int> ss;
4fd800b3a8 2011-02-23        kinaba: 		vector<int> visited(FULL+1, -1);
4fd800b3a8 2011-02-23        kinaba: 		for(int i=1,s=1; i<=maxN; ++i)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			s = (s<<1 | ((~s&MASK)==MASK)) & FULL;
4fd800b3a8 2011-02-23        kinaba: 			if( visited[s] >= 0 )
4fd800b3a8 2011-02-23        kinaba: 				return countBits(ss, visited[s], ss.size(), maxN);
4fd800b3a8 2011-02-23        kinaba: 			else
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				visited[s] = ss.size();
4fd800b3a8 2011-02-23        kinaba: 				ss.push_back(s&1);
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return countBits(ss, 0, maxN, maxN);
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int countBits(const vector<int>& b, int lb, int le, int N)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		// Given an infinite seq b[0] ... b[lb-1] (b[lb] ... b[le-1])*,
4fd800b3a8 2011-02-23        kinaba: 		// compute \Sigma b[0..N)
4fd800b3a8 2011-02-23        kinaba: 		int sum = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<lb; ++i)
4fd800b3a8 2011-02-23        kinaba: 			sum += b[i];
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		N -= lb;
4fd800b3a8 2011-02-23        kinaba: 		int ll = le - lb;
4fd800b3a8 2011-02-23        kinaba: 		int Q = N/ll;
4fd800b3a8 2011-02-23        kinaba: 		int R = N%ll;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=lb; i<le; ++i)
4fd800b3a8 2011-02-23        kinaba: 			sum += b[i] * Q;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=lb; i<lb+R; ++i)
4fd800b3a8 2011-02-23        kinaba: 			sum += b[i];
4fd800b3a8 2011-02-23        kinaba: 		return sum;
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(_, LongLongNim().numberOfWins(maxN, moves));}
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 maxN = 20;
4fd800b3a8 2011-02-23        kinaba: 	int moves_[] = {1,2,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moves(moves_, moves_+sizeof(moves_)/sizeof(*moves_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 5;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int maxN = 999;
4fd800b3a8 2011-02-23        kinaba: 	int moves_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moves(moves_, moves_+sizeof(moves_)/sizeof(*moves_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 499;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int maxN = 6543;
4fd800b3a8 2011-02-23        kinaba: 	int moves_[] = {2,4,7,11,20};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moves(moves_, moves_+sizeof(moves_)/sizeof(*moves_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1637;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int maxN = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int moves_[] = {1,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moves(moves_, moves_+sizeof(moves_)/sizeof(*moves_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 333333333;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int maxN = ;
4fd800b3a8 2011-02-23        kinaba: 	int moves_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moves(moves_, moves_+sizeof(moves_)/sizeof(*moves_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int maxN = ;
4fd800b3a8 2011-02-23        kinaba: 	int moves_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> moves(moves_, moves_+sizeof(moves_)/sizeof(*moves_));
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