Add more solutions (30 / 48)

Author: derekhh

Algorithms/Implementation/acm-icpc-team.cpp

@@ -7,7 +7,7 @@ I felt guilty for those who had watched and starred my repository. Thus, I'm try
 |Domain|Status|Last Updated|
 |---|---|---|
 |[Algorithms - Warmup](domains/algorithms/warmup/README.md)|9 / 9|1/21/2017|
-|[Algorithms - Implementation](domains/algorithms/implementation/README.md)|24 / 48|2/5/2017|
+|[Algorithms - Implementation](domains/algorithms/implementation/README.md)|30 / 48|2/5/2017|
 |*Algorithms - Constructive Algorithms*|||
 |*Algorithms - Strings*|||
 |*Algorithms - Sorting*|||

Algorithms/Implementation/encryption.cpp

@@ -2,7 +2,7 @@
 
 This repository keeps a list of the problems in [Algorithms - Implementation](https://www.hackerrank.com/domains/algorithms/implementation). The threshold I'm currently using is 15, 30 and 45 minutes for each easy, medium and hard problem, respectively.
 
-## Submissions (24 / 48)
+## Submissions (30 / 48)
 
 |Problem|Solution|Difficulty|Date|Time|#Sub|Comment|
 |---|---|---|---|---|---|---|
@@ -29,4 +29,28 @@ This repository keeps a list of the problems in [Algorithms - Implementation](ht
 |[Non-Divisible Subset](https://www.hackerrank.com/challenges/non-divisible-subset)|[non-divisible-subset.cpp](non-divisible-subset.cpp)|Medium|2/5/2017|4'32"|1||
 |[Repeated String](https://www.hackerrank.com/challenges/repeated-string)|[repeated-string.cpp](repeated-string.cpp)|Easy|2/5/2017|3'01"|1||
 |[Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds)|[jumping-on-the-clouds.cpp](jumping-on-the-clouds.cpp)|Easy|2/5/2017|4'41"|1||
-|[Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array)|[equality-in-a-array.cpp](equality-in-a-array.cpp)|Easy|2/5/2017|2'17"|1||
+|[Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array)|[equality-in-a-array.cpp](equality-in-a-array.cpp)|Easy|2/5/2017|2'17"|1||
+|[ACM ICPC Team](https://www.hackerrank.com/challenges/acm-icpc-team)|[acm-icpc-team.cpp](acm-icpc-team.cpp)|Easy|2/5/2017|4'05"|1||
+|[Taum and B'day](https://www.hackerrank.com/challenges/taum-and-bday)|[taum-and-bday.cpp](taum-and-bday.cpp)|Easy|2/5/2017|3'57"|1||
+|[Encryption](https://www.hackerrank.com/challenges/encryption)|[encryption.cpp](encryption.cpp)|Medium|2/5/2017|11'30"|1||
+|[Bigger is Greater](https://www.hackerrank.com/challenges/bigger-is-greater)|[bigger-is-greater.cpp](bigger-is-greater.cpp)|Medium|2/5/2017|13'49"|1||
+|[Modified Kaprekar Numbers](https://www.hackerrank.com/challenges/kaprekar-numbers)|[kaprekar-numbers.cpp](kaprekar-numbers.cpp)|Easy|2/5/2017|5'09"|1||
+|[Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets)|[beautiful-triplets.cpp](beautiful-triplets.cpp)|Easy|2/5/2017|3'58"|2||
+|[Manasa and Stones](https://www.hackerrank.com/challenges/manasa-and-stones)|manasa-and-stones.cpp|Easy|||||
+|[Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances)|minimum-distances.cpp|Easy|||||
+|[The Time in Words](https://www.hackerrank.com/challenges/the-time-in-words)|the-time-in-words.cpp|Medium|||||
+|[Cavity Map](https://www.hackerrank.com/challenges/cavity-map)|cavity-map.cpp|Easy|||||
+|[Chocolate Feast](https://www.hackerrank.com/challenges/chocolate-feast)|chocolate-feast.cpp|Easy|||||
+|[Service Lane](https://www.hackerrank.com/challenges/service-lane)|service-lane.cpp|Easy|||||
+|[Lisa's Workbook](https://www.hackerrank.com/challenges/lisa-workbook)|lisa-workbook.cpp|Easy|||||
+|[The Grid Search](https://www.hackerrank.com/challenges/the-grid-search)|the-grid-search.cpp|Medium|||||
+|[Flatland Space Stations](https://www.hackerrank.com/challenges/flatland-space-stations)|flatland-space-stations.cpp|Easy|||||
+|[Fair Rations](https://www.hackerrank.com/challenges/fair-rations)|fair-rations.cpp|Easy|||||
+|[Happy Ladybugs](https://www.hackerrank.com/challenges/happy-ladybugs)|happy-ladybugs.cpp|Easy|||||
+|[Strange Counter](https://www.hackerrank.com/challenges/strange-code)|strange-code.cpp|Easy|||||
+|[Almost Sorted](https://www.hackerrank.com/challenges/almost-sorted)|almost-sorted.cpp|Medium|||||
+|[Absolute Permutation](https://www.hackerrank.com/challenges/absolute-permutation)|absolute-permutation.cpp|Medium|||||
+|[The Bomberman Game](https://www.hackerrank.com/challenges/bomber-man)|bomber-man.cpp|Medium|||||
+|[Ema's Supercomputer](https://www.hackerrank.com/challenges/two-pluses)|two-pluses.cpp|Medium|||||
+|[Larry's Array](https://www.hackerrank.com/challenges/larrys-array)|larrys-array.cpp|Medium|||||
+|[Matrix Layer Rotation](https://www.hackerrank.com/challenges/matrix-rotation-algo)|matrix-rotation-algo.cpp|Hard|||||

Algorithms/Implementation/find-digits.cpp

@@ -0,0 +1,44 @@
+/*
+  acm-icpc-team.cpp
+  ACM ICPC Team
+*/
+
+#include <iostream>
+#include <string>
+#include <vector>
+using namespace std;
+
+vector<vector<bool> > v;
+
+int main() {
+  int n, m;
+  cin >> n >> m;
+  v.resize(n);
+  for (int i = 0; i < n; i++) {
+    v[i].resize(m);
+    string str;
+    cin >> str;
+    for (int j = 0; j < m; j++) {
+      v[i][j] = str[j] - '0';
+    }
+  }
+  int maxTopic = 0, maxCnt = 0;
+  for (int i = 0; i < n; i++) {
+    for (int j = i + 1; j < n; j++) {
+      int cntTopic = 0;
+      for (int k = 0; k < m; k++) {
+        if (v[i][k] || v[j][k]) {
+          cntTopic++;
+        }
+      }
+      if (cntTopic > maxTopic) {
+        maxTopic = cntTopic;
+        maxCnt = 1;
+      } else if (cntTopic == maxTopic) {
+        maxCnt++;
+      }
+    }
+  }
+  cout << maxTopic << endl << maxCnt << endl;
+  return 0;
+}

Algorithms/Implementation/taum-and-bday.cpp

@@ -0,0 +1,34 @@
+/*
+  beautiful-triplets.cpp
+  Beautiful triplets
+
+  My first submission got WA. I've created an array `h` of size that is exactly
+  20001. Clearly this has some out-of-bound issues when checking h[v[i] + d] and
+  h[v[i] + d + d].
+*/
+
+#include <iostream>
+#include <vector>
+using namespace std;
+
+vector<int> v;
+bool h[21001];
+
+int main() {
+  int n, d;
+  cin >> n >> d;
+  for (int i = 0; i < n; i++) {
+    int num;
+    cin >> num;
+    v.push_back(num);
+    h[num] = true;
+  }
+  int cnt = 0;
+  for (int i = 0; i < n; i++) {
+    if (h[v[i] + d] && h[v[i] + d + d]) {
+      cnt++;
+    }
+  }
+  cout << cnt << endl;
+  return 0;
+}

README.md

@@ -0,0 +1,42 @@
+/*
+  bigger-is-greater.cpp
+  Bigger is Greater
+*/
+
+#include <algorithm>
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main() {
+  int t;
+  cin >> t;
+  while (t--) {
+    string s;
+    cin >> s;
+    int pos = -1;
+    for (int i = s.size() - 1; i > 0; i--) {
+      if (s[i] > s[i - 1]) {
+        pos = i;
+        break;
+      }
+    }
+    if (pos == -1) {
+      cout << "no answer" << endl;
+    } else {
+      int minVal = 1000, maxIdx = -1;
+      for (int i = pos; i < s.size(); i++) {
+        if (s[i] > s[pos - 1]) {
+          if (s[i] < minVal || (s[i] == minVal && i > maxIdx)) {
+            minVal = s[i];
+            maxIdx = i;
+          }
+        }
+      }
+      swap(s[pos - 1], s[maxIdx]);
+      reverse(s.begin() + pos, s.end());
+      cout << s << endl;
+    }
+  }
+  return 0;
+}