leetcode

commit 744f3716db1a2504b730a3f412be1b0516f61450
parent d84519d4d115251af42c780c825447d1a7559868
Author: Jack Sangdahl <jack@pngu.org>
Date:   Tue,  4 Mar 2025 21:17:37 -0700

2579. count total number of coloured cells

Diffstat:
A
count_total_coloured_cell.c
 | 
17
+++++++++++++++++
A
count_total_coloured_cell.py
 | 
24
++++++++++++++++++++++++

2 files changed, 41 insertions(+), 0 deletions(-)
diff --git a/count_total_coloured_cell.c b/count_total_coloured_cell.c
@@ -0,0 +1,17 @@
+// 2579. Count Total Number of Colored Cells
+#include "leetcode.h"
+
+/*
+ * there exists an infinitely large two-dimensional grid of uncoloured unit
+ * cells. you are given a positive integer 'n', indicating that you must do the
+ * following routine for 'n' minutes: at the first minute, colour any arbitrary
+ * unit cell blue, and every minute thereafter, colour blue every uncoloured
+ * cell that touches a blue cell.
+ */
+
+long long coloredCells(int n) { return 2L * n * (n - 1) + 1; }
+
+int main() {
+  printf("%lld\n", coloredCells(1)); // expect: 1
+  printf("%lld\n", coloredCells(2)); // expect: 5
+}
diff --git a/count_total_coloured_cell.py b/count_total_coloured_cell.py
@@ -0,0 +1,24 @@
+# 2579. Count Total Number of Colored Cells
+
+"""
+there exists an infinitely large two-dimensional grid of uncoloured unit
+cells. you are given a positive integer 'n', indicating that you must do the
+following routine for 'n' minutes: at the first minute, colour any arbitrary
+unit cell blue, and every minute thereafter, colour blue every uncoloured
+cell that touches a blue cell.
+"""
+
+
+class Solution(object):
+    def coloredCells(self, n):
+        """
+        :type n: int
+        :rtype: int
+        """
+        return 1 + 4 * sum(range(n))
+
+
+if __name__ == "__main__":
+    obj = Solution()
+    print(obj.coloredCells(n=1))
+    print(obj.coloredCells(n=2))