srm 626 div 2 250

Author: keshavnandan

SumOfPower.cpp

@@ -0,0 +1,46 @@
+#include <iostream>
+#include <sstream>
+#include <vector>
+#include <algorithm>
+#include <set>
+#include <map>
+#include <numeric>
+using namespace std;
+
+class SumOfPower {
+        public:
+        int findSum(vector <int> a)
+        {
+            int sum = 0;
+            int n = a.size();
+            for(int i = 1; i <= n; i++){
+                int s = 0;
+                for(int j = 0; j+i <= n; j++)
+                    s += accumulate(a.begin()+j, a.begin()+j+i, 0);
+                sum += s;
+            }
+            return sum;
+        }
+
+// BEGIN CUT HERE
+	public:
+	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); }
+	private:
+	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
+	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
+	void test_case_0() { int Arr0[] = {1,2}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 6; verify_case(0, Arg1, findSum(Arg0)); }
+	void test_case_1() { int Arr0[] = {1,1,1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 10; verify_case(1, Arg1, findSum(Arg0)); }
+	void test_case_2() { int Arr0[] = {3,14,15,92,65}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1323; verify_case(2, Arg1, findSum(Arg0)); }
+	void test_case_3() { int Arr0[] = {1,2,3,4,5,6,7,8,9,10}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1210; verify_case(3, Arg1, findSum(Arg0)); }
+
+// END CUT HERE
+
+};
+
+// BEGIN CUT HERE
+     int main()
+     {
+        SumOfPower ___test;
+        ___test.run_test(-1);
+     }
+// END CUT HERE

SumOfPower.txt

@@ -0,0 +1,63 @@
+PROBLEM STATEMENT
+
+You are given a vector <int> array.
+At any moment, you may choose a nonempty contiguous subsequence of array.
+Whenever you do so, you will gain power equal to the sum of all elements in the chosen subsequence.
+
+
+
+You chose each possible contiguous subsequence exactly once, each time gaining some power.
+Compute and return the total amount of power you gained.
+
+
+DEFINITION
+Class:SumOfPower
+Method:findSum
+Parameters:vector <int>
+Returns:int
+Method signature:int findSum(vector <int> array)
+
+
+CONSTRAINTS
+-array will contain between 1 and 50 elements, inclusive.
+-Each element in array will be between 1 and 100, inclusive.
+
+
+EXAMPLES
+
+0)
+{1,2}
+
+Returns: 6
+
+We have the following three contiguous subsequences:
+
+ {1} => 1 
+ {2} => 2 
+ {1,2} => 3 
+
+Thus, the sum of all possible powers is 1+2+3=6.
+
+1)
+{1,1,1}
+
+Returns: 10
+
+A 3-element sequence has 6 possible nonempty contiguous subsequences.
+For the sequence {1,1,1} these are the subsequences: {1}, {1}, {1}, {1,1}, {1,1}, and {1,1,1}.
+Their sums are 1, 1, 1, 2, 2, and 3.
+If you choose each of them once, the total power you'll gain is 1+1+1+2+2+3 = 10.
+
+2)
+{3,14,15,92,65}
+
+Returns: 1323
+
+
+
+3)
+{1,2,3,4,5,6,7,8,9,10}
+
+Returns: 1210
+
+