Data update

Task/Disarium-numbers/C-sharp/disarium-numbers.cs

@@ -0,0 +1,32 @@
+using System;
+
+class DisariumNumbers {
+    // Method to check if a number is a Disarium number
+    public static bool IsDisarium(int num) {
+        int n = num;
+        int len = num.ToString().Length;
+        int sum = 0;
+        int i = 1;
+        while (n > 0) {
+            // C# does not support implicit conversion from double to int, so we explicitly convert the result of Math.Pow to int
+            sum += (int)Math.Pow(n % 10, len - i + 1);
+            n /= 10;
+            i++;
+        }
+        return sum == num;
+    }
+
+    static void Main(string[] args) {
+        int i = 0;
+        int count = 0;
+        // Find and print the first 19 Disarium numbers
+        while (count <= 18) {
+            if (IsDisarium(i)) {
+                Console.Write($"{i} ");
+                count++;
+            }
+            i++;
+        }
+        Console.WriteLine();
+    }
+}

Task/Disarium-numbers/Odin/disarium-numbers.odin

@@ -0,0 +1,38 @@
+package disarium
+import "core:fmt"
+import "core:math"
+
+/* main block start */
+main :: proc() {
+	fmt.print("\nThe first 18 Disarium numbers are:")
+	count, i: int
+	for count < 19 {
+		if is_disarium(i) {
+			fmt.print(" ", i)
+			count += 1
+		}
+		i += 1
+	}
+	fmt.println("")
+} /* main block end */
+
+/* proc definitions */
+power :: proc(base, exponent: int) -> int {
+	result := 1
+	for _ in 1 ..= exponent {
+		result *= base
+	}
+	return result
+}
+
+is_disarium :: proc(num: int) -> bool {
+	n := num
+	sum := 0
+	len := n <= 9 ? 1 : cast(int)math.floor_f64(math.log10_f64(auto_cast n) + 1)
+	for n > 0 {
+		sum += power(n % 10, len)
+		n /= 10
+		len -= 1
+	}
+	return num == sum
+}