Weekly Contest 128

Author: MaskRay

capacity-to-ship-packages-within-d-days.cc

@@ -0,0 +1,16 @@
+// Capacity To Ship Packages Within D Days
+class Solution {
+public:
+  int shipWithinDays(vector<int>& ws, int D) {
+    long l = *max_element(ws.begin(), ws.end()), h = ws.size()*500;
+    while (l < h) {
+      long m = l+h >> 1, c = 0, x = 0;
+      for (int w: ws)
+        if ((x += w) > m)
+          c++, x = w;
+      if (c < D) h = m;
+      else l = m+1;
+    }
+    return l;
+  }
+};

complement-of-base-10-integer.cc

@@ -0,0 +1,7 @@
+// Complement of Base 10 Integer
+class Solution {
+public:
+  int bitwiseComplement(int N) {
+    return N ? (1 << 32-__builtin_clz(N)) - 1 - N : 1;
+  }
+};

numbers-with-1-repeated-digit..cc

@@ -0,0 +1,32 @@
+// Numbers With 1 Repeated Digit
+#define FOR(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (a); i < (b); i++)
+#define REP(i, n) FOR(i, 0, n)
+#define ROF(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (b); --i >= (a); )
+
+class Solution {
+public:
+  int numDupDigitsAtMostN(int N) {
+    int m = 0, n = N+1, a[10], u[10] = {};
+    do a[m++] = n%10;
+    while (n /= 10);
+    int c = a[m-1], r = c-1;
+    u[c] = 1;
+    REP(j, m-1)
+      r *= 9-j;
+    REP(j, m-1) {
+      int c = 9;
+      REP(k, j)
+        c *= 9-k;
+      r += c;
+    }
+    ROF(i, 0, m-1) {
+      c = a[i]-accumulate(u, u+a[i], 0);
+      REP(j, i)
+        c *= 10-m+i-j;
+      r += c;
+      if (u[a[i]]) break;
+      u[a[i]] = 1;
+    }
+    return N-r;
+  }
+};

pairs-of-songs-with-total-durations-divisible-by-60.cc

@@ -0,0 +1,12 @@
+// Pairs of Songs With Total Durations Divisible by 60
+class Solution {
+public:
+  int numPairsDivisibleBy60(vector<int> &time) {
+    int c[60] = {}, r = 0;
+    for (int x : time) {
+      r += c[x%60];
+      c[(60-x%60)%60]++;
+    }
+    return r;
+  }
+};