snake_case all the things

project_euler/problem_01/sol1.py

@@ -0,0 +1,17 @@
+'''
+Problem Statement:
+If we list all the natural numbers below 10 that are multiples of 3 or 5,
+we get 3,5,6 and 9. The sum of these multiples is 23.
+Find the sum of all the multiples of 3 or 5 below N.
+'''
+from __future__ import print_function
+try:
+    raw_input          # Python 2
+except NameError:
+    raw_input = input  # Python 3
+n = int(raw_input().strip())
+sum=0
+for a in range(3,n):
+    if(a%3==0 or a%5==0):
+        sum+=a
+print(sum)

project_euler/problem_01/sol2.py

@@ -0,0 +1,20 @@
+'''
+Problem Statement:
+If we list all the natural numbers below 10 that are multiples of 3 or 5,
+we get 3,5,6 and 9. The sum of these multiples is 23.
+Find the sum of all the multiples of 3 or 5 below N.
+'''
+from __future__ import print_function
+try:
+    raw_input          # Python 2
+except NameError:
+    raw_input = input  # Python 3
+n = int(raw_input().strip())
+sum = 0
+terms = (n-1)//3
+sum+= ((terms)*(6+(terms-1)*3))//2 #sum of an A.P.
+terms = (n-1)//5
+sum+= ((terms)*(10+(terms-1)*5))//2
+terms = (n-1)//15
+sum-= ((terms)*(30+(terms-1)*15))//2
+print(sum)

project_euler/problem_01/sol3.py

@@ -0,0 +1,50 @@
+from __future__ import print_function
+
+'''
+Problem Statement:
+If we list all the natural numbers below 10 that are multiples of 3 or 5,
+we get 3,5,6 and 9. The sum of these multiples is 23.
+Find the sum of all the multiples of 3 or 5 below N.
+'''
+'''
+This solution is based on the pattern that the successive numbers in the series follow: 0+3,+2,+1,+3,+1,+2,+3.
+'''
+
+try:
+    raw_input          # Python 2
+except NameError:
+    raw_input = input  # Python 3
+n = int(raw_input().strip())
+sum=0
+num=0
+while(1):
+    num+=3
+    if(num>=n):
+        break
+    sum+=num
+    num+=2
+    if(num>=n):
+        break
+    sum+=num
+    num+=1
+    if(num>=n):
+        break
+    sum+=num
+    num+=3
+    if(num>=n):
+        break
+    sum+=num
+    num+=1
+    if(num>=n):
+        break
+    sum+=num
+    num+=2
+    if(num>=n):
+        break
+    sum+=num
+    num+=3
+    if(num>=n):
+        break
+    sum+=num
+
+print(sum);

project_euler/problem_01/sol4.py

@@ -0,0 +1,30 @@
+def mulitples(limit):
+    xmulti = []
+    zmulti = []
+    z = 3
+    x = 5
+    temp = 1
+    while True:
+        result = z * temp
+        if (result < limit):
+            zmulti.append(result)
+            temp += 1
+        else:
+            temp = 1
+            break
+    while True:
+        result = x * temp
+        if (result < limit):
+            xmulti.append(result)
+            temp += 1
+        else:
+            break
+    collection = list(set(xmulti+zmulti))
+    return (sum(collection))
+    
+    
+        
+        
+        
+    
+print (mulitples(1000))