feat: DCC 09-11-2024 added.

solutions/1006. Clumsy Factorial/1006.cs

@@ -0,0 +1,21 @@
+public class Solution
+{
+    public int Clumsy(int n)
+    {
+        if (n == 1)
+            return 1;
+        if (n == 2)
+            return 2;
+        if (n == 3)
+            return 6;
+        if (n == 4)
+            return 7;
+        if (n % 4 == 1)
+            return n + 2;
+        if (n % 4 == 2)
+            return n + 2;
+        if (n % 4 == 3)
+            return n - 1;
+        return n + 1;
+    }
+}

solutions/3133. Minimum Array End/3133.cs

@@ -0,0 +1,25 @@
+public class Solution
+{
+    public long MinEnd(int n, int x)
+    {
+        // Set x's 0s with (n - 1)'s LSb-to-MSb bits, preserving x's 1s. This
+        // operation increases x for (n - 1) iterations while preserving x's 1s.
+        int kMaxBit = (int)(Math.Log2(n) + Math.Log2(x) + 2);
+        long k = n - 1;
+        long ans = x;
+        int kBinaryIndex = 0;
+
+        for (int i = 0; i < kMaxBit; ++i)
+        {
+            if ((ans >> i & 1) == 0)
+            {
+                // Set x's 0 with k's bit if the running bit of k is 1.
+                if ((k >> kBinaryIndex & 1) == 1)
+                    ans |= 1L << i;
+                ++kBinaryIndex;
+            }
+        }
+
+        return ans;
+    }
+}