ADDED   SRM/498-U/1A.cpp
Index: SRM/498-U/1A.cpp
==================================================================
--- SRM/498-U/1A.cpp
+++ SRM/498-U/1A.cpp
@@ -0,0 +1,126 @@
+#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>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class FoxSequence { public:
+	string isValid(vector <int> seq) 
+	{
+		for(int b=2; b<seq.size(); ++b)
+			for(int c=b; c<seq.size()-2; ++c)
+				if( isFox(seq,b,c) )
+					return "YES";
+		return "NO";
+	}
+
+	bool isFox( const vector<int>& seq, const int b, const int c )
+	{
+		for(int i=b; i<=c; ++i)
+			if( seq[i] != seq[b] )
+				return false;
+		return isUpDown(seq, 0, b) && isUpDown(seq, c, seq.size()-1);
+	}
+
+	bool isUpDown( const vector<int>& seq, const int L, const int R )
+	{
+		int i = max_element(seq.begin()+L, seq.begin()+R+1) - seq.begin();
+		if( L<i && i<R )
+		{
+			if( seq[L+1]>seq[L] && isArith(seq, L, i, seq[L+1]-seq[L])
+			 && seq[R-1]>seq[R] && isArith(seq, i, R, seq[i+1]-seq[i]) )
+			 return true;
+		}
+		return false;
+	}
+
+	bool isArith( const vector<int>& seq, const int L, const int R, int d )
+	{
+		for(int i=L; i+1<=R; ++i)
+			if( seq[i+1]-seq[i] != d )
+				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 string& Expected, const 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(_, FoxSequence().isValid(seq));}
+int main(){
+
+CASE(0)
+	int seq_[] = {1,3,5,7,5,3,1,1,1,3,5,7,5,3,1}
+;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = "YES"; 
+END
+CASE(1)
+	int seq_[] = {1,2,3,4,5,4,3,2,2,2,3,4,5,6,4}
+;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = "YES"; 
+END
+CASE(2)
+	int seq_[] = {3,6,9,1,9,5,1}
+;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = "YES"; 
+END
+CASE(3)
+	int seq_[] = {1,2,3,2,1,2,3,2,1,2,3,2,1}
+;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = "NO"; 
+END
+CASE(4)
+	int seq_[] = {1,3,4,3,1,1,1,1,3,4,3,1}
+;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = "NO"; 
+END
+CASE(5)
+	int seq_[] = {6,1,6}
+;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = "NO"; 
+END
+/*
+CASE(6)
+	int seq_[] = ;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = ; 
+END
+CASE(7)
+	int seq_[] = ;
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	string _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/498-U/1B.cpp
Index: SRM/498-U/1B.cpp
==================================================================
--- SRM/498-U/1B.cpp
+++ SRM/498-U/1B.cpp
@@ -0,0 +1,149 @@
+#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>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+static const int MODVAL = 1000000009; // op/ depends on primarity of the MODVAL
+struct mint
+{
+	int val;
+	mint():val(0){}
+	mint(int x):val(x%MODVAL) {}
+	mint(LL  x):val(x%MODVAL) {}
+};
+
+mint operator+(mint x, mint y) { return x.val+y.val; }
+mint operator-(mint x, mint y) { return x.val-y.val+MODVAL; }
+mint operator*(mint x, mint y) { return LL(x.val)*y.val; }
+mint POW(mint x, int e) {
+	mint v = 1;
+	for(;e;x=x*x,e>>=1)
+		if(e&1)
+			v=v*x;
+	return v;
+}
+mint operator/(mint x, mint y) { return x * POW(y, MODVAL-2); }
+
+vector<mint> FAC_(1,1);
+void FAC_INIT(int n) { for(int i=1; i<=n; ++i) FAC_.push_back( FAC_.back()*i ); }
+mint FAC(mint x)       { return FAC_[x.val]; }
+mint C(mint n, mint k) { return k.val<0 || n.val<k.val ? 0 : FAC(n) / (FAC(k) * FAC(n-k)); }
+
+class FoxStones { public:
+	int getCount(int W, int H, vector <int> sx, vector <int> sy) 
+	{
+		if(FAC_.size()==1)
+			FAC_INIT(200*200+1);
+
+		map<vector<int>,int> dd;
+		for(int y=0; y<H; ++y)
+			for(int x=0; x<W; ++x)
+			{
+				vector<int> dis;
+				for(int i=0; i<sx.size(); ++i)
+				{
+					int d = max(abs(sy[i]-1-y), abs(sx[i]-1-x));
+					dis.push_back(d);
+				}
+				dd[dis]++;
+			}
+		mint ans = 1;
+		for(map<vector<int>,int>::iterator it=dd.begin(); it!=dd.end(); ++it)
+		{
+			int n = it->second;
+			ans = ans * FAC(n);
+		}
+		return ans.val;
+	}
+};
+
+// 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(_, FoxStones().getCount(N, M, sx, sy));}
+int main(){
+
+CASE(0)
+	int N = 6; 
+	int M = 1; 
+	int sx_[] = {3};
+	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
+	int sy_[] = {1};
+	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
+	int _ = 4; 
+END
+CASE(1)
+	int N = 2; 
+	int M = 2; 
+	int sx_[] = {2};
+	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
+	int sy_[] = {1};
+	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
+	int _ = 6; 
+END
+CASE(2)
+	int N = 3; 
+	int M = 3; 
+	int sx_[] = {1,2,3};
+	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
+	int sy_[] = {1,2,3};
+	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
+	int _ = 8; 
+END
+CASE(3)
+	int N = 12; 
+	int M = 34; 
+	int sx_[] = {5,6,7,8,9,10};
+	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
+	int sy_[] = {11,12,13,14,15,16};
+	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
+	int _ = 410850247; 
+END
+/*
+CASE(4)
+	int N = ; 
+	int M = ; 
+	int sx_[] = ;
+	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
+	int sy_[] = ;
+	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
+	int _ = ; 
+END
+CASE(5)
+	int N = ; 
+	int M = ; 
+	int sx_[] = ;
+	  vector <int> sx(sx_, sx_+sizeof(sx_)/sizeof(*sx_)); 
+	int sy_[] = ;
+	  vector <int> sy(sy_, sy_+sizeof(sy_)/sizeof(*sy_)); 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/498-U/2C.cpp
Index: SRM/498-U/2C.cpp
==================================================================
--- SRM/498-U/2C.cpp
+++ SRM/498-U/2C.cpp
@@ -0,0 +1,82 @@
+#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>
+using namespace std;
+typedef long long LL;
+typedef complex<double> CMP;
+
+class NinePuzzle { public:
+	int getMinimumCost(string init, string goal) 
+	{
+		multiset<char> s;
+		for(int i=0; i<init.size(); ++i)
+			s.insert( init[i] );
+		int cnt = 0;
+		for(int i=0; i<goal.size(); ++i)
+			if( s.count(goal[i]) )
+				s.erase( s.find(goal[i]) );
+			else
+				++cnt;
+		return cnt;
+	}
+};
+
+// 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(_, NinePuzzle().getMinimumCost(init, goal));}
+int main(){
+
+CASE(0)
+	string init = "BG*YRGRRYR" ; 
+	string goal = "BGGY*YRRRR" ; 
+	int _ = 0; 
+END
+CASE(1)
+	string init = "GBBB*BGBBG" ; 
+	string goal = "RYYY*YRYYR"; 
+	int _ = 9; 
+END
+CASE(2)
+	string init = "RRBR*BRBBB" ; 
+	string goal = "BBRB*RBRRR" ; 
+	int _ = 1; 
+END
+/*
+CASE(3)
+	string init = ; 
+	string goal = ; 
+	int _ = ; 
+END
+CASE(4)
+	string init = ; 
+	string goal = ; 
+	int _ = ; 
+END
+*/
+}
+// END CUT HERE