ADDED   SRM/657-U/1A.cpp
Index: SRM/657-U/1A.cpp
==================================================================
--- SRM/657-U/1A.cpp
+++ SRM/657-U/1A.cpp
@@ -0,0 +1,120 @@
+#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 <tuple>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class ProblemSets { public:
+	long long maxSets(long long E, long long EM, long long M, long long MH, long long H)
+	{
+		LL L=0, R=0x7fffffffffffffffLL; // can make [L,R)
+		while(R-L>1) {
+			LL C = L+(R-L)/2;
+			(can(E,EM,M,MH,H,C) ? L : R) = C;
+		}
+		return L;
+	}
+
+	bool can(long long E, long long EM, long long M, long long MH, long long H, LL nProbs) {
+		LL eNeed = max(0LL, nProbs-E);
+		LL mNeed = max(0LL, nProbs-M);
+		LL hNeed = max(0LL, nProbs-H);
+		if(EM < eNeed) return false;
+		EM -= eNeed;
+		if(MH < hNeed) return false;
+		MH -= hNeed;
+		return mNeed <= EM+MH;
+	}
+};
+
+// 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(_, ProblemSets().maxSets(E, EM, M, MH, H));}
+int main(){
+
+CASE(0)
+	long long E = 2LL; 
+	long long EM = 2LL; 
+	long long M = 1LL; 
+	long long MH = 2LL; 
+	long long H = 2LL; 
+	long long _ = 3LL; 
+END
+CASE(1)
+	long long E = 100LL; 
+	long long EM = 100LL; 
+	long long M = 100LL; 
+	long long MH = 0LL; 
+	long long H = 0LL; 
+	long long _ = 0LL; 
+END
+CASE(2)
+	long long E = 657LL; 
+	long long EM = 657LL; 
+	long long M = 657LL; 
+	long long MH = 657LL; 
+	long long H = 657LL; 
+	long long _ = 1095LL; 
+END
+CASE(3)
+	long long E = 1LL; 
+	long long EM = 2LL; 
+	long long M = 3LL; 
+	long long MH = 4LL; 
+	long long H = 5LL; 
+	long long _ = 3LL; 
+END
+CASE(4)
+	long long E = 1000000000000000000LL; 
+	long long EM = 1000000000000000000LL; 
+	long long M = 1000000000000000000LL; 
+	long long MH = 1000000000000000000LL; 
+	long long H = 1000000000000000000LL; 
+	long long _ = 1666666666666666666LL; 
+END
+/*
+CASE(5)
+	long long E = LL; 
+	long long EM = LL; 
+	long long M = LL; 
+	long long MH = LL; 
+	long long H = LL; 
+	long long _ = LL; 
+END
+CASE(6)
+	long long E = LL; 
+	long long EM = LL; 
+	long long M = LL; 
+	long long MH = LL; 
+	long long H = LL; 
+	long long _ = LL; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/657-U/1B-U.cpp
Index: SRM/657-U/1B-U.cpp
==================================================================
--- SRM/657-U/1B-U.cpp
+++ SRM/657-U/1B-U.cpp
@@ -0,0 +1,117 @@
+#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 <tuple>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+bool is_prime(int p)
+{
+	for(int q=2; q*q<=p; ++q)
+		if(p%q==0)
+			return false;
+	return true;
+}
+
+static const unsigned MODVAL = 1000000007;
+struct mint
+{
+	unsigned val;
+	mint():val(0){}
+	mint(int      x):val(x%MODVAL) {}
+	mint(unsigned x):val(x%MODVAL) {}
+	mint(LL       x):val(x%MODVAL) {}
+};
+mint& operator*=(mint& x, mint y) { return x = LL(x.val)*y.val; }
+mint operator*(mint x, mint y) { return x*=y; }
+mint POW(mint x, LL e) { mint v=1; for(;e;x*=x,e>>=1) if(e&1) v*=x; return v; }
+
+class PolynomialGCD { public:
+	int gcd(string s)
+	{
+		mint ans = 1;
+		for(int p=2; p<=s.size()+1; ++p)
+			if(is_prime(p))
+				ans *= POW(p, howManyTimesAlwaysDivisibleByP(s, p));
+		return ans.val;
+	}
+
+	int howManyTimesAlwaysDivisibleByP(const string& s, int p)
+	{
+		static const int INF = 0x7fffffff;
+		int at_least = INF;
+		for(int k=-p; k<=+p; ++k) {
+			int cur = 0;
+			for(int b=((k+p+p-1)/p-1)*p,i=s.size()-1-(b-k); i>=0; b+=p,i-=p) {
+				int e = s[i]-'0';
+				if(b==0 && e)
+					goto next;
+				if(e)
+					for(int bb=b; bb%p==0; bb/=p)
+						cur+=e;
+			}
+			at_least = min(at_least, cur);
+			next:;
+		}
+		return at_least;
+	}
+};
+
+// 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(_, PolynomialGCD().gcd(s));}
+int main(){
+
+CASE(0)
+	string s = "111"; 
+	int _ = 6; 
+END
+CASE(1)
+	string s = "00000"; 
+	int _ = 1; 
+END
+CASE(2)
+	string s = "2014"; 
+	int _ = 16; 
+END
+CASE(3)
+	string s = "31415926535"; 
+	int _ = 659897170; 
+END
+/*
+CASE(4)
+	string s = ; 
+	int _ = ; 
+END
+CASE(5)
+	string s = ; 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE