ADDED   SRM/TCO12-1/1A.cpp
Index: SRM/TCO12-1/1A.cpp
==================================================================
--- SRM/TCO12-1/1A.cpp
+++ SRM/TCO12-1/1A.cpp
@@ -0,0 +1,118 @@
+#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>
+#ifdef __GNUC__
+#include <ext/hash_map>
+#define unordered_map __gnu_cxx::hash_map
+#else
+#include <unordered_map>
+#endif
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class EllysJuice { public:
+	vector <string> getWinners(vector <string> players)
+	{
+		set<string> winners;
+
+		sort(players.begin(), players.end());
+		do
+			winners.insert( play(players) );
+		while( next_permutation(players.begin(), players.end()) );
+
+		winners.erase("");
+		return vector<string>(winners.begin(), winners.end());
+	}
+
+	string play(const vector<string>& p)
+	{
+		int juice[2] = {65536, 65536};
+		map<string, int> total;
+		for(int i=0; i<p.size(); ++i)
+			total[p[i]] += (juice[i%2]/=2);
+
+		string best_name;
+		int best = 0;
+		bool tie = false;
+		for(map<string, int>::iterator it=total.begin(); it!=total.end(); ++it)
+			if( it->second > best ) {
+				best_name = it->first;
+				best = it->second;
+				tie = false;
+			}
+			else if( it->second == best )
+				tie = true;
+		return tie ? "" : best_name;
+	}
+};
+
+// 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 vector <string>& Expected, const vector <string>& 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(_, EllysJuice().getWinners(players));}
+int main(){
+
+CASE(0)
+	string players_[] = { "elly", "kriss", "stancho", "elly", "stancho" };
+	  vector <string> players(players_, players_+sizeof(players_)/sizeof(*players_)); 
+	string __[] = {"elly", "stancho" };
+	  vector <string> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(1)
+	string players_[] = {"torb", "elly", "stancho", "kriss"};
+	  vector <string> players(players_, players_+sizeof(players_)/sizeof(*players_)); 
+	vector <string> _; 
+END
+CASE(2)
+	string players_[] = {"elly", "elly", "elly", "elly", "elly"};
+	  vector <string> players(players_, players_+sizeof(players_)/sizeof(*players_)); 
+	string __[] = {"elly" };
+	  vector <string> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(3)
+	string players_[] = { "ariadne", "elly", "ariadne", "stancho", "stancho", "kriss", "stancho", "elly" };
+	  vector <string> players(players_, players_+sizeof(players_)/sizeof(*players_)); 
+	string __[] = {"ariadne", "elly", "stancho" };
+	  vector <string> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(4)
+	string players_[] = {"b","b","a","a"};
+	  vector <string> players(players_, players_+sizeof(players_)/sizeof(*players_)); 
+    string __[] = {"a","b"};
+	  vector <string> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+/*
+CASE(5)
+	string players_[] = ;
+	  vector <string> players(players_, players_+sizeof(players_)/sizeof(*players_)); 
+	string __[] = ;
+	  vector <string> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/TCO12-1/1B.cpp
Index: SRM/TCO12-1/1B.cpp
==================================================================
--- SRM/TCO12-1/1B.cpp
+++ SRM/TCO12-1/1B.cpp
@@ -0,0 +1,103 @@
+#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>
+#ifdef __GNUC__
+#include <ext/hash_map>
+#define unordered_map __gnu_cxx::hash_map
+#else
+#include <unordered_map>
+#endif
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class EllysFractions { public:
+	long long getCount(int N)
+	{
+		LL total = 0;
+		for(int k=2; k<=N; ++k)
+			total += getExact(k);
+		return total;
+	}
+
+	LL getExact(int N)
+	{
+		int np = 0;
+		for(int p=2; p<=N; ++p)
+			if(is_prime(p))
+				++np;
+		LL v = 1;
+		for(int i=0; i<np; ++i)
+			v *= 2;
+		return v/2;
+	}
+
+	bool is_prime(int n)
+	{
+		for(int k=2; k<n; ++k)
+			if(n%k == 0)
+				return false;
+		return true;
+	}
+};
+
+// 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 long long& Expected, const long long& 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(_, EllysFractions().getCount(N));}
+int main(){
+
+CASE(0)
+	int N = 1; 
+	long long _ = 0LL; 
+END
+CASE(1)
+	int N = 2; 
+	long long _ = 1LL; 
+END
+CASE(2)
+	int N = 3; 
+	long long _ = 3LL; 
+END
+CASE(3)
+	int N = 5; 
+	long long _ = 9LL; 
+END
+CASE(4)
+	int N = 100; 
+	long long _ = 177431885LL; 
+END
+CASE(5)
+	int N = 250; 
+	long long _ = -1LL; 
+END
+CASE(6)
+	int N = 4; 
+	long long _ = 5LL; 
+END
+}
+// END CUT HERE

ADDED   SRM/TCO12-1/1C.cpp
Index: SRM/TCO12-1/1C.cpp
==================================================================
--- SRM/TCO12-1/1C.cpp
+++ SRM/TCO12-1/1C.cpp
@@ -0,0 +1,273 @@
+#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>
+#ifdef __GNUC__
+#include <ext/hash_map>
+#define unordered_map __gnu_cxx::hash_map
+#else
+#include <unordered_map>
+#endif
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+struct UnionFind
+{
+	vector<int> uf, sz;
+	int nc;
+
+	UnionFind(int N): uf(N), sz(N,1), nc(N)
+		{ for(int i=0; i<N; ++i) uf[i] = i; }
+	int size()
+		{ return nc; }
+	int Find(int a)
+		{ return uf[a]==a ? a : uf[a]=Find(uf[a]); }
+	bool Union(int a, int b)
+		{
+			a = Find(a);
+			b = Find(b);
+			if( a != b )
+			{
+				if( sz[a] >= sz[b] ) swap(a, b);
+				uf[a] = b;
+				sz[b] += sz[a];
+				--nc;
+			}
+			return (a!=b);
+		}
+};
+
+class EllysLights { public:
+	int getMinimum(string initial, vector <string> switches)
+	{
+		int N = switches.size();
+		UnionFind uf(N*2+2);
+		#define TR 0
+		#define FL 1
+		#define POS(x) ((x)+2)
+		#define NEG(x) ((x)+N+2)
+
+		for(int i=0; i<initial.size(); ++i)
+		{
+			vector<int> sw;
+			for(int k=0; k<N; ++k)
+				if( switches[k][i]=='Y' )
+					sw.push_back(k);
+
+			if(initial[i] == 'Y')
+				if(sw.size() == 0)
+				{
+					return -1;
+				}
+				else if(sw.size() == 1)
+				{
+					uf.Union(POS(sw[0]), TR);
+					uf.Union(NEG(sw[0]), FL);
+				}
+				else
+				{
+					uf.Union(POS(sw[0]), NEG(sw[1]));
+					uf.Union(NEG(sw[0]), POS(sw[1]));
+				}
+			else
+				if(sw.size() == 0)
+				{
+				}
+				else if(sw.size() == 1)
+				{
+					uf.Union(POS(sw[0]), FL);
+					uf.Union(NEG(sw[0]), TR);
+				}
+				else
+				{
+					uf.Union(POS(sw[0]), POS(sw[1]));
+					uf.Union(NEG(sw[0]), NEG(sw[1]));
+				}
+		}
+
+		if( uf.Find(TR) == uf.Find(FL) )
+			return -1;
+		for(int k=0; k<N; ++k)
+			if( uf.Find(POS(k)) == uf.Find(NEG(k)) )
+				return -1;
+
+		int minSwitch = 0;
+		set<int> done;
+		for(int k=0; k<N; ++k)
+			if( !done.count(k) )
+			{
+				vector<int> pos(1, k);
+				vector<int> neg;
+				for(int j=k+1; j<N; ++j)
+					if( !done.count(j) )
+						if( uf.Find(POS(k)) == uf.Find(POS(j)) ) {
+							pos.push_back(j);
+							done.insert(j);
+						} else if( uf.Find(POS(k)) == uf.Find(NEG(j)) ) {
+							neg.push_back(j);
+							done.insert(j);
+						}
+				if( uf.Find(POS(k)) == uf.Find(TR) ) {
+					minSwitch += pos.size();
+				}
+				else if( uf.Find(POS(k)) == uf.Find(FL) ) {
+					minSwitch += neg.size();
+				}
+				else {
+					minSwitch += min(pos.size(), neg.size());
+				}
+			}
+		return minSwitch;
+	}
+};
+
+// 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(_, EllysLights().getMinimum(initial, switches));}
+int main(){
+
+CASE(0)
+	string initial = "YNYNNN"; 
+	string switches_[] = {"YNNYNY", "NYYYNN", "YNYNYN", "NNNNYN", "NYNNNY"};
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = 2; 
+END
+CASE(1)
+	string initial = "YNYNYN"; 
+	string switches_[] = {"NNNNNN", "YYYYYY", "NYNNNN", "NNNYNN", "NNNNNY"};
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = 4; 
+END
+CASE(2)
+	string initial = "YYN"; 
+	string switches_[] = {"YNY", "NYN"};
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = -1; 
+END
+CASE(3)
+	string initial = "NNYNYNYYYNNYYYYN"; 
+	string switches_[] = {"NYNYNYNYNYNYNYNY",
+ "YNYNYNYNYNYNYNYN",
+ "NNNNNNNNNNNNNNNN",
+ "YNNNNNNNNNNNNNNN",
+ "NYNNNNNNNNNNNNNN",
+ "NNYNNNNNNNNNNNNN",
+ "NNNYNNNNNNNNNNNN",
+ "NNNNYNNNNNNNNNNN",
+ "NNNNNYNNNNNNNNNN",
+ "NNNNNNYNNNNNNNNN",
+ "NNNNNNNYNNNNNNNN",
+ "NNNNNNNNYNNNNNNN",
+ "NNNNNNNNNYNNNNNN",
+ "NNNNNNNNNNYNNNNN",
+ "NNNNNNNNNNNYNNNN",
+ "NNNNNNNNNNNNYNNN",
+ "NNNNNNNNNNNNNYNN",
+ "NNNNNNNNNNNNNNYN",
+ "NNNNNNNNNNNNNNNY"};
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = 6; 
+END
+CASE(4)
+	string initial = "NYNYNYYYNNYYYNNYNNYYYYYNNYNYYYY"; 
+	string switches_[] = {"NNNNNNNNNNNNNNNNNNYNNNNNNNNNNNN",
+ "NNNNNNNNYNNNYNNNNYYNYNNNNYNNNNN",
+ "NNNNNNNNNYNNNNNNNNNNNNYNNNNNNNN",
+ "NNNNNYNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NYNNNNNNNNNNNNYNNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNYYNNNNNNNNNNNNNNNY",
+ "NNNNNNYNNNNNNNNNNNNYNNNNNYNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "YNNNNNNNNNNNNNNNNNNYNNNNNNNNNNN",
+ "NNNYNNNNNNNNNNNNNNNNNNNYYNNNNNN",
+ "NYNNNNNNNNNNYNNNNNNNNNNNNNNNYNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNYNNNNNNNNNNNNNNNNNNNNNNNNY",
+ "NNNNNNNNNNYNNNNNNNNNYYYNNNNNNNN",
+ "NNNYNNNNNNNNNNNNNNNNNNNNNNNYNNN",
+ "NNNNNNNNYNNNNNNNNNNNNNNNYNNNNNN",
+ "YNNNYNNNNNNNNNNNNNNNNNNNNNNYNNN",
+ "NNNNNNNNNNYNNNNNNNNNNNNNNNNNNNN",
+ "NNNNYNNYNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNYNNNYNNNYNNNNNNNNNNNNNYN"};
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = 7; 
+END
+CASE(5)
+	string initial = "NYNYYNYNYYYYNNYNYNNYYNNNNNYNYNNNNNYNNNYN"; 
+	string switches_[] = {"NNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNYNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNN",
+ "NNNNNNNNNYNNNNYNNYNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNYNNNNYNNNNNNNYNNNNNNN",
+ "NNNNNYNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNYNNNNNNNNYNNNYNNNNNYNN",
+ "NNNNNNNNNNYNNNNNNNNNNNNNNYNNNNNYNNYNNNNN",
+ "NNNNNYNNYNNYNNNNNNNNNNNNNNNNNNNNNYNNNNNN",
+ "YNNNYNNNNNNNNNNNNNYNNNYNNYNNNNNNNYNNNNNN",
+ "NNNNNNNNNYYNNNNNNNNNNNNYNNNNYNNNNNNNNNNN",
+ "NNNNNNNNNNNYNYNNNNNNNNNNNNNNNNNNNNNNNNNY",
+ "NNNNNNNNNNNNYNNNNNNNNNNNYNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNNNNNNN",
+ "NNNYNNNNNNNNNNNNNNNNNYNNNNNNNNNNYNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNNYNNYNNNNNNNNNNNNNNNNNNNNNN",
+ "NNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYYNNY",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNYNNNNNYNYNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNN",
+ "NYNNNNNNNNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNN",
+ "NNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NYNNNNYNNNNNNNNNNNNNNNNNNNNYNNNNNNNNNNNN",
+ "NNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNYNN",
+ "NNNNNNNNNNNNYNNYYNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNYNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN",
+ "NNNYNNNNNNNNNNNNNNNNYYNNNNNNNNNNNNNNNNNN",
+ "NNNNNNNNYNNNNNNNNNNNNNNNNNNNYNYNNNNNNNNN",
+ "NNNNNNNNNNNNNNNNNNNNNNNNNNYNNYNNNNNNYNNN"};
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = -1; 
+END
+/*
+CASE(6)
+	string initial = ; 
+	string switches_[] = ;
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = ; 
+END
+CASE(7)
+	string initial = ; 
+	string switches_[] = ;
+	  vector <string> switches(switches_, switches_+sizeof(switches_)/sizeof(*switches_)); 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE