ADDED   SRM/643-U/1A.cpp
Index: SRM/643-U/1A.cpp
==================================================================
--- SRM/643-U/1A.cpp
+++ SRM/643-U/1A.cpp
@@ -0,0 +1,121 @@
+#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 TheKingsFactorization { public:
+	vector<long long> getVector(long long N, vector<long long> primes)
+	{
+		vector<LL> ans;
+		for(int p=2; p<=1000001; ++p)
+			while(N%p == 0) {
+				ans.push_back(p);
+				N /= p;
+			}
+
+		// all primes <= cbrt(N) is reported. we have at most 2 more.
+
+		const LL last_p = primes.back();
+		if(N%last_p==0 && N!=last_p) {
+			ans.push_back(min(N/last_p, last_p));
+			ans.push_back(max(N/last_p, last_p));
+			N = 1;
+		}
+
+		if(N!=1)
+			ans.push_back(N);
+
+		return ans;
+	}
+};
+
+// 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<long long>& Expected, const vector<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(_, TheKingsFactorization().getVector(N, primes));}
+int main(){
+
+CASE(0)
+	long long N = 12LL; 
+	long long primes_[] = {2, 3};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	long long __[] = {2, 2, 3 };
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(1)
+	long long N = 7LL; 
+	long long primes_[] = {7};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	long long __[] = {7 };
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(2)
+	long long N = 1764LL; 
+	long long primes_[] = {2, 3, 7};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	long long __[] = {2, 2, 3, 3, 7, 7 };
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(3)
+	long long N = 49LL; 
+	long long primes_[] = {7};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	long long __[] = {7, 7 };
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(4)
+	long long N = 210LL; 
+	long long primes_[] = {2, 5};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	long long __[] = {2, 3, 5, 7 };
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(5)
+	long long N = 100000LL; 
+	long long primes_[] = {2, 2, 2, 5, 5};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	long long __[] = {2, 2, 2, 2, 2, 5, 5, 5, 5, 5 };
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(6)
+	long long N = 540000003780LL; 
+	long long primes_[] = {2,3,3,1000000007};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	  long long __[] = {2,2,3,3,3,5,1000000007};
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+CASE(7)
+	long long N = 2700000018900LL; 
+	long long primes_[] = {2,3,3,5};
+	  vector<long long> primes(primes_, primes_+sizeof(primes_)/sizeof(*primes_)); 
+	  long long __[] = {2,2,3,3,3,5,5,1000000007};
+	  vector<long long> _(__, __+sizeof(__)/sizeof(*__)); 
+END
+}
+// END CUT HERE

ADDED   SRM/643-U/1B-U.cpp
Index: SRM/643-U/1B-U.cpp
==================================================================
--- SRM/643-U/1B-U.cpp
+++ SRM/643-U/1B-U.cpp
@@ -0,0 +1,139 @@
+#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;
+
+enum {HH, HS, SH, SS};
+
+class TheKingsArmyDiv1 { public:
+	int getNumber(vector <string> state)
+	{
+		const int N = state[0].size();
+
+		vector<int> s;
+		for(int i=0; i<N; ++i) 
+			s.push_back((state[0][i]=='S')*2 + (state[1][i]=='S'));
+
+		const int nSS = count(s.begin(), s.end(), SS);
+		if(nSS == N)
+			return -1;
+
+		vector<vector<int>> blocks;
+		for(int i=0; i<N; ) {
+			while(i<N && s[i]==SS) ++i;
+			if(i<N) {
+				blocks.emplace_back();
+				while(i<N && s[i]!=SS) {
+					if(s[i] != HH)
+						blocks.back().push_back(s[i]);
+					++i;
+				}
+				if(blocks.back().empty())
+					blocks.pop_back();
+			}
+		}
+
+		int c1=0, c2=0;
+		for(auto& bl: blocks) {
+			c1 += align_cost(bl, HS);
+			c2 += align_cost(bl, SH);
+		}
+		return nSS + (blocks.empty() ? 0 : min(c1, c2)+1);
+	}
+
+	int align_cost(const vector<int>& b, int type)
+	{
+		int cost = 0;
+		for(int i=0; i<b.size(); ) {
+			while(i<b.size() && b[i]==type) ++i;
+			if(i<b.size()) {
+				while(i<b.size() && b[i]!=type) ++i;
+				++cost;
+			}
+		}
+		return cost;
+	}
+};
+
+// 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(_, TheKingsArmyDiv1().getNumber(state));}
+int main(){
+
+CASE(0)
+	string state_[] = {"HSH", 
+ "SHS"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = 2; 
+END
+CASE(1)
+	string state_[] = {"HH", 
+ "HH"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = 0; 
+END
+CASE(2)
+	string state_[] = {"HHHHH", 
+ "HSHSH"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = 1; 
+END
+CASE(3)
+	string state_[] = {"S", 
+ "S"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = -1; 
+END
+CASE(4)
+	string state_[] = {"HSHHSHSHSHHHSHSHSH", 
+ "SSSSHSSHSHSHHSSSSH"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = 8; 
+END
+CASE(5)
+	string state_[] = {"HS",
+ "HS"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = 1; 
+END
+CASE(6)
+string state_[] = {"HHH", "SSS"};
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = 1; 
+END
+/*
+CASE(7)
+	string state_[] = ;
+	  vector <string> state(state_, state_+sizeof(state_)/sizeof(*state_)); 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE