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: LL comb(LL n, LL k)
4fd800b3a8 2011-02-23        kinaba: {
4fd800b3a8 2011-02-23        kinaba: 	k = min(k, n-k);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	LL c = 1;
4fd800b3a8 2011-02-23        kinaba: 	for(LL i=0; i<k; ++i)
4fd800b3a8 2011-02-23        kinaba: 		c *= n-i, c /= i+1;
4fd800b3a8 2011-02-23        kinaba: 	return c;
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class TheQuestionsAndAnswersDivOne { public:
4fd800b3a8 2011-02-23        kinaba: 	int find(int questions, vector <string> answers)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int Y = count(answers.begin(), answers.end(), string("Yes"));
4fd800b3a8 2011-02-23        kinaba: 		int N = count(answers.begin(), answers.end(), string( "No"));
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int cnt = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int y=0; y<=questions; ++y)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int n = questions - y;
4fd800b3a8 2011-02-23        kinaba: 			if( y<=Y && n<=N )
4fd800b3a8 2011-02-23        kinaba: 				cnt += distr(Y,y)*distr(N,n)*comb(questions, y);
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return cnt;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int distr(int n, int k)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( k <= 1 )
4fd800b3a8 2011-02-23        kinaba: 			return (k==1 || n==0&&k==0) ? 1 : 0;
4fd800b3a8 2011-02-23        kinaba: 		int sum = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(int m=1; m<(1<<n); ++m) {
4fd800b3a8 2011-02-23        kinaba: 			int pop = 0;
4fd800b3a8 2011-02-23        kinaba: 			for(int i=1; i<=m; i<<=1)
4fd800b3a8 2011-02-23        kinaba: 				if(m&i)
4fd800b3a8 2011-02-23        kinaba: 					++pop;
4fd800b3a8 2011-02-23        kinaba: 			if( n-pop >= k-1 )
4fd800b3a8 2011-02-23        kinaba: 				sum += distr(n-pop, k-1);
4fd800b3a8 2011-02-23        kinaba: 		}
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(_, TheQuestionsAndAnswersDivOne().find(questions, answers));}
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 questions = 2;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"No", "Yes"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 2;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"No", "No", "No"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 3;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"Yes", "No", "No", "Yes"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 12;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 3;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"Yes", "Yes", "Yes", "No"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 18;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 2;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"Yes","Yes"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 2;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"No","No"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 2;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"Yes","No"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int questions = 7;
4fd800b3a8 2011-02-23        kinaba: 	string answers_[] = {"Yes","Yes","Yes","Yes","Yes","Yes","Yes","Yes","Yes"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> answers(answers_, answers_+sizeof(answers_)/sizeof(*answers_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 40320*9;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE