ADDED   SRM/501-U/1A.cpp
Index: SRM/501-U/1A.cpp
==================================================================
--- SRM/501-U/1A.cpp
+++ SRM/501-U/1A.cpp
@@ -0,0 +1,110 @@
+#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 FoxPlayingGame { public:
+	double theMax(int nA, int nB, int paramA, int paramB) 
+	{
+		double scoreA = paramA / 1000.0;
+		double scoreB = paramB / 1000.0;
+
+		double cur=scoreA*nA, best=cur;
+		for(int i=0; i<=nB; ++i,cur*=scoreB)
+		   best = max(best, cur);
+		return best;
+	}
+};
+
+// 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 double& Expected, const double& Received) {
+ bool ok = (abs(Expected - Received) < 1e-9);
+ 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(_, FoxPlayingGame().theMax(nA, nB, paramA, paramB));}
+int main(){
+
+CASE(0)
+	int nA = 5; 
+	int nB = 4; 
+	int paramA = 3000; 
+	int paramB = 2000; 
+	double _ = 240.0; 
+END
+CASE(1)
+	int nA = 3; 
+	int nB = 3; 
+	int paramA = 2000; 
+	int paramB = 100; 
+	double _ = 6.0; 
+END
+CASE(2)
+	int nA = 4; 
+	int nB = 3; 
+	int paramA = -2000; 
+	int paramB = 2000; 
+	double _ = -8.0; 
+END
+CASE(3)
+	int nA = 5; 
+	int nB = 5; 
+	int paramA = 2000; 
+	int paramB = -2000; 
+	double _ = 160.0; 
+END
+CASE(4)
+	int nA = 50; 
+	int nB = 50; 
+	int paramA = 10000; 
+	int paramB = 2000; 
+	double _ = 5.62949953421312E17; 
+END
+CASE(5)
+	int nA = 41; 
+	int nB = 34; 
+	int paramA = 9876; 
+	int paramB = -1234; 
+	double _ = 515323.9982341775; 
+END
+CASE(6)
+	int nA = 23;
+	int nB = 34; 
+	int paramA = -9422; 
+	int paramB = -180; 
+	double _ = 39.00708; 
+END
+/*
+CASE(7)
+	int nA = ; 
+	int nB = ; 
+	int paramA = ; 
+	int paramB = ; 
+	double _ = ; 
+END
+*/
+}
+// END CUT HERE

ADDED   SRM/501-U/1B.cpp
Index: SRM/501-U/1B.cpp
==================================================================
--- SRM/501-U/1B.cpp
+++ SRM/501-U/1B.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;
+
+template<typename T>
+struct DP4
+{
+	int N1, N2, N3, N4;
+	vector<T> data;
+	DP4(int N1, int N2, int N3, int N4, const T& t = T())
+		: N1(N1), N2(N2), N3(N3), N4(N4), data(N1*N2*N3*N4, t) { assert(data.size()*sizeof(T)<(1<<26)); }
+	T& operator()(int i1, int i2, int i3, int i4)
+		{ return data[ (((i1*N2)+i2)*N3+i3)*N4+i4 ]; }
+};
+
+static const int MODVAL = 1000000007;
+
+class FoxAverageSequence { public:
+	int theCount(vector <int> seq) 
+	{
+		const int N = seq.size();
+
+		DP4<LL> dp(N,2,41,40*N+1);
+		for(int b=0; b<=40; ++b)
+			if( seq[0]==-1 || seq[0]==b )
+				dp(0,0,b,b) += 1;
+
+		for(int i=1; i<N; ++i)
+			for(int dn=0; dn<=1; ++dn)
+			for(int  b=0;  b<=40; ++b)
+			for(int  s=0;  s<=40*i; ++s)
+			if( LL v = dp(i-1,dn,b,s) )
+				for(int c=0; c<=min(40,s/i); ++c)
+					if( seq[i]==-1 || seq[i]==c )
+						if( !dn || b<=c )
+							(dp(i,b>c,c,s+c) += v) %= MODVAL;
+
+		LL ans = 0;
+		for(int dn=0; dn<=1; ++dn)
+		for(int  b=0;  b<=40; ++b)
+		for(int  s=0;  s<=40*N; ++s)
+			ans += dp(N-1,dn,b,s);
+		return ans % MODVAL;
+	}
+};
+
+// 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(_, FoxAverageSequence().theCount(seq));}
+int main(){
+
+CASE(0)
+	int seq_[] = {3, -1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 4; 
+END
+CASE(1)
+	int seq_[] = {5, 3, -1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 2; 
+END
+CASE(2)
+	int seq_[] = {-1, 0, 40};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 0; 
+END
+CASE(3)
+	int seq_[] = {-1, 40, -1, -1, -1, 10, -1, -1, -1, 21, -1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 579347890; 
+END
+CASE(4)
+	int seq_[] = {-1, 12, 25, 0, 18, -1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 58; 
+END
+CASE(5)
+int seq_[] = {-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = -1; 
+END
+CASE(6)
+	int seq_[] = {-1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 41; 
+END
+CASE(7)
+	int seq_[] = {-1,-1};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = (41+1)*41/2; 
+END
+CASE(8)
+	int seq_[] = {-1,-1,0};
+	  vector <int> seq(seq_, seq_+sizeof(seq_)/sizeof(*seq_)); 
+	int _ = 81; 
+END
+}
+// END CUT HERE