From c2aa074304ff746d12350e80e877b2a92cdaeb3f Mon Sep 17 00:00:00 2001
From: Madhur Rathod <168186481+MadhurRathod@users.noreply.github.com>
Date: Sat, 26 Oct 2024 15:58:21 +0530
Subject: [PATCH] Create 001

solution for problem 001
---
 project_euler/problem_001/001 | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 project_euler/problem_001/001

diff --git a/project_euler/problem_001/001 b/project_euler/problem_001/001
new file mode 100644
index 000000000..3ada9bf57
--- /dev/null
+++ b/project_euler/problem_001/001
@@ -0,0 +1,25 @@
+# solved #001
+"""
+Project Euler Problem 1: https://projecteuler.net/problem=1
+
+Multiples of 3 or 5
+
+"""
+
+def solution(n: int = 1000) -> int:
+    """
+    For number i in 1 to 1000 we take modulus of 3 and 5 with each number and when any of their value is zero we add that number to sum_count varialbe.
+
+    """
+    n = 1000
+    sum_count = 0
+    for i in range(1,n+1):
+        if i%3==0 or i%5==0:
+            sum_count += i
+
+    return sum_count
+
+
+if __name__ == "__main__":
+    print(f"{solution() = }")
+