mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
Merge pull request #244 from arcsinecosine/master
My solution to the problem
This commit is contained in:
commit
c4234192fa
32
Project Euler/Problem 01/sol4.py
Normal file
32
Project Euler/Problem 01/sol4.py
Normal file
|
@ -0,0 +1,32 @@
|
|||
def mulitples(limit):
|
||||
xmulti = []
|
||||
zmulti = []
|
||||
z = 3
|
||||
x = 5
|
||||
temp = 1
|
||||
while True:
|
||||
result = z * temp
|
||||
if (result < limit):
|
||||
zmulti.append(result)
|
||||
temp += 1
|
||||
continue
|
||||
else:
|
||||
temp = 1
|
||||
break
|
||||
while True:
|
||||
result = x * temp
|
||||
if (result < limit):
|
||||
xmulti.append(result)
|
||||
temp += 1
|
||||
continue
|
||||
else:
|
||||
temp = 1
|
||||
break
|
||||
return (sum(zmulti) + sum(xmulti))
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
print (mulitples(100))
|
13
Project Euler/Problem 02/sol2.py
Normal file
13
Project Euler/Problem 02/sol2.py
Normal file
|
@ -0,0 +1,13 @@
|
|||
def fib(n):
|
||||
ls = []
|
||||
a,b = 0,1
|
||||
n += 1
|
||||
for i in range(n):
|
||||
if (b % 2 == 0):
|
||||
ls.append(b)
|
||||
else:
|
||||
pass
|
||||
a,b = b, a+b
|
||||
print (sum(ls))
|
||||
return None
|
||||
fib(10)
|
Loading…
Reference in New Issue
Block a user