Add more solutions (42 / 48)

Author: derekhh

README.md

@@ -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)|40 / 48|2/5/2017|
+|[Algorithms - Implementation](domains/algorithms/implementation/README.md)|42 / 48|2/6/2017|
 |*Algorithms - Constructive Algorithms*|||
 |*Algorithms - Strings*|||
 |*Algorithms - Sorting*|||

domains/algorithms/implementation/README.md

@@ -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 (40 / 48)
+## Submissions (42 / 48)
 
 |Problem|Solution|Difficulty|Date|Time|#Sub|Comment|
 |---|---|---|---|---|---|---|
@@ -46,8 +46,8 @@ This repository keeps a list of the problems in [Algorithms - Implementation](ht
 |[The Grid Search](https://www.hackerrank.com/challenges/the-grid-search)|[the-grid-search.cpp](the-grid-search.cpp)|Medium|2/6/2017|5'20"|1||
 |[Flatland Space Stations](https://www.hackerrank.com/challenges/flatland-space-stations)|[flatland-space-stations.cpp](flatland-space-stations.cpp)|Easy|2/6/2017|4'14"|1||
 |[Fair Rations](https://www.hackerrank.com/challenges/fair-rations)|[fair-rations.cpp](fair-rations.cpp)|Easy|2/6/2017|4'07"|1||
-|[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|||||
+|[Happy Ladybugs](https://www.hackerrank.com/challenges/happy-ladybugs)|[happy-ladybugs.cpp](happy-ladybugs.cpp)|Easy|2/6/2017|7'25"|2||
+|[Strange Counter](https://www.hackerrank.com/challenges/strange-code)|[strange-code.cpp](strange-code.cpp)|Easy|2/6/2017|2'24"|1||
 |[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|||||

domains/algorithms/implementation/happy-ladybugs.cpp

@@ -0,0 +1,63 @@
+/*
+  happy-ladybugs.cpp
+  Happy Ladybugs
+
+  My first submission got WA and I wrote something like this:
+
+  if (i + 1 < str.size() && isalpha(str[i + 1])) {
+    happy = true;
+  }
+
+  It's hard to describe what I was thinking at that time...
+*/
+
+#include <cstring>
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main() {
+  int g;
+  cin >> g;
+  while (g--) {
+    int n;
+    cin >> n;
+    string str;
+    cin >> str;
+    int cnt[26];
+    memset(cnt, 0, sizeof(cnt));
+    bool hasEmptyCell = false;
+    bool hasUnhappyLadybugs = false;
+    for (int i = 0; i < str.size(); i++) {
+      if (str[i] >= 'A' && str[i] <= 'Z') {
+        cnt[str[i] - 'A']++;
+        bool happy = false;
+        if (i + 1 < str.size() && str[i + 1] == str[i]) {
+          happy = true;
+        }
+        if (i - 1 >= 0 && str[i - 1] == str[i]) {
+          happy = true;
+        }
+        if (!happy) {
+          hasUnhappyLadybugs = true;
+        }
+      } else {
+        hasEmptyCell = true;
+      }
+    }
+    if (!hasUnhappyLadybugs) {
+      cout << "YES" << endl;
+    } else {
+      if (!hasEmptyCell) {
+        cout << "NO" << endl;
+      } else {
+        bool canAdjust = true;
+        for (int i = 0; i < 26; i++) {
+          if (cnt[i] == 1) canAdjust = false;
+        }
+        cout << (canAdjust ? "YES" : "NO") << endl;
+      }
+    }
+  }
+  return 0;
+}

domains/algorithms/implementation/strange-code.cpp

@@ -0,0 +1,23 @@
+/*
+  strange-code.cpp
+  Strange Counter
+*/
+
+#include <iostream>
+using namespace std;
+
+int main() {
+  long long t;
+  cin >> t;
+  long long curCycleLen = 3;
+  while (t >= curCycleLen) {
+    t -= curCycleLen;
+    curCycleLen *= 2;
+  }
+  if (t == 0) {
+    cout << 1 << endl;
+  } else {
+    cout << curCycleLen - t + 1 << endl;
+  }
+  return 0;
+}