TCO 2014 Round 1C

Author: keshavnandan

FizzBuzzTurbo.cpp

@@ -0,0 +1,49 @@
+#include <iostream>
+#include <sstream>
+#include <vector>
+#include <algorithm>
+#include <set>
+#include <map>
+using namespace std;
+
+class FizzBuzzTurbo
+        {
+        public:
+        vector<long long> counts(long long A, long long B)
+            {
+                long long a = B/3 - A/3;
+                long long b = B/5 - A/5;
+                long long c = B/15 - A/15;
+                if(A%3 == 0) a++;
+                if(A%5 == 0) b++;
+                if(A%15 == 0) c++;
+                long long fb = c, fz = a - c, bz = b - c;
+                vector<long long> v;
+                v.push_back(fz);
+                v.push_back(bz);
+                v.push_back(fb);
+                return v;
+            }
+
+// 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 vector<long long> &Expected, const vector<long long> &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: " << print_array(Expected) << endl; cerr << "\tReceived: " << print_array(Received) << endl; } }
+	void test_case_0() { long long Arg0 = 1LL; long long Arg1 = 4LL; long Arr2[] = {1, 0, 0 }; vector<long long> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(0, Arg2, counts(Arg0, Arg1)); }
+	void test_case_1() { long long Arg0 = 2LL; long long Arg1 = 6LL; long Arr2[] = {2, 1, 0 }; vector<long long> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(1, Arg2, counts(Arg0, Arg1)); }
+	void test_case_2() { long long Arg0 = 150LL; long long Arg1 = 165LL; long Arr2[] = {4, 2, 2 }; vector<long long> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(2, Arg2, counts(Arg0, Arg1)); }
+	void test_case_3() { long long Arg0 = 474747LL; long long Arg1 = 747474LL; long Arr2[] = {72728, 36363, 18182 }; vector<long long> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); verify_case(3, Arg2, counts(Arg0, Arg1)); }
+
+// END CUT HERE
+
+        };
+
+// BEGIN CUT HERE
+     int main()
+     {
+        FizzBuzzTurbo ___test;
+        ___test.run_test(-1);
+     }
+// END CUT HERE

FizzBuzzTurbo.txt

@@ -0,0 +1,75 @@
+PROBLEM STATEMENT
+
+Fizz Buzz is a simple game used to teach kids about divisibility.
+The goal of the game is to say positive integers in increasing order, with a twist:
+You don't say the numbers divisible by 3 and 5.
+Instead, whenever a number was divisible by 3 you say "fizz" and for a number divisible by 5 you say "buzz".
+(Thus, if a number was divisible by 15, you say "fizzbuzz".)
+
+
+
+Here is how the game starts: 1, 2, fizz, 4, buzz, fizz, 7, 8, fizz, buzz, 11, fizz, 13, 14, fizzbuzz, 16, 17, fizz, 19, buzz, fizz, 22, 23, fizz, buzz, 26, fizz, 28, 29, fizzbuzz, 31, 32, fizz, 34, buzz, fizz, ...
+
+
+
+Fizz Buzz has also become a traditional programming interview question.
+However, in this problem we have a more tricky assignment for you.
+
+
+
+You are given long longs A and B.
+Consider the part of the game that corresponds to integers from A to B, inclusive.
+During this part of the game, you will say "fizz" X times, "buzz" Y times, and "fizzbuzz" Z times.
+Return a vector<long long> with three elements: {X,Y,Z}.
+
+
+DEFINITION
+Class:FizzBuzzTurbo
+Method:counts
+Parameters:long long, long long
+Returns:vector<long long>
+Method signature:vector<long long> counts(long long A, long long B)
+
+
+NOTES
+-The return value can be quite large. Make sure to use the appropriate data type.
+
+
+CONSTRAINTS
+-A will be between 1 and 10^18, inclusive.
+-B will be between A and 10^18, inclusive.
+
+
+EXAMPLES
+
+0)
+1
+4
+
+Returns: {1, 0, 0 }
+
+This is the sequence "1, 2, fizz, 4".
+
+1)
+2
+6
+
+Returns: {2, 1, 0 }
+
+This is the sequence "2, fizz, 4, buzz, fizz".
+
+2)
+150
+165
+
+Returns: {4, 2, 2 }
+
+This sequence begins and ends with a "fizzbuzz". There are some "fizz"es and some "buzz"es inbetween.
+
+3)
+474747
+747474
+
+Returns: {72728, 36363, 18182 }
+
+

Unique.cpp

@@ -0,0 +1,47 @@
+#include <iostream>
+#include <sstream>
+#include <vector>
+#include <algorithm>
+#include <set>
+#include <map>
+using namespace std;
+
+class Unique
+        {
+        public:
+        string removeDuplicates(string S)
+            {
+                int c[1000];
+                string ret;
+                for(int i = 'a'; i <= 'z'; i++) c[i] = 0;
+                for(int i = 0; i < S.size(); i++){
+                    if(c[S[i]] == 0){
+                        c[S[i]] = 1;
+                        ret += S[i];
+                    }
+                }
+                return ret;
+            }
+
+// 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 string &Expected, const string &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() { string Arg0 = "banana"; string Arg1 = "ban"; verify_case(0, Arg1, removeDuplicates(Arg0)); }
+	void test_case_1() { string Arg0 = "aardvark"; string Arg1 = "ardvk"; verify_case(1, Arg1, removeDuplicates(Arg0)); }
+	void test_case_2() { string Arg0 = "xxxxx"; string Arg1 = "x"; verify_case(2, Arg1, removeDuplicates(Arg0)); }
+	void test_case_3() { string Arg0 = "topcoder"; string Arg1 = "topcder"; verify_case(3, Arg1, removeDuplicates(Arg0)); }
+
+// END CUT HERE
+
+        };
+
+// BEGIN CUT HERE
+     int main()
+     {
+        Unique ___test;
+        ___test.run_test(-1);
+     }
+// END CUT HERE

Unique.txt

@@ -0,0 +1,58 @@
+PROBLEM STATEMENT
+
+You are given a string S of lowercase English letters.
+
+
+
+Some of the letters may occur multiple times in S.
+For example, there are three 'a's and two 'n's in "banana".
+
+
+
+You dislike duplicates.
+For each letter, you want to keep only its first occurrence and delete all the others.
+Return the string obtained from S by deleting the duplicates of each letter, as described above.
+
+
+DEFINITION
+Class:Unique
+Method:removeDuplicates
+Parameters:string
+Returns:string
+Method signature:string removeDuplicates(string S)
+
+
+CONSTRAINTS
+-S will contain between 1 and 1000 characters, inclusive.
+-Each character of S will be a lowercase English letter ('a'-'z').
+
+
+EXAMPLES
+
+0)
+"banana"
+
+Returns: "ban"
+
+
+
+1)
+"aardvark"
+
+Returns: "ardvk"
+
+
+
+2)
+"xxxxx"
+
+Returns: "x"
+
+
+
+3)
+"topcoder"
+
+Returns: "topcder"
+
+