mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
02c0daf9e5
* Adding variable to fade out ambiguity * More readability on merge sorting algorithm * Updating merge_sort_fastest description and explaining why * Adding tests file with imports * Standardazing filenames and function names * Adding test cases and test functions * Adding test loop * Putting 'user oriented code' inside main condition for having valid imports * Fixing condition * Updating tests: adding cases and todo list * Refactoring first euler problem's first solution
14 lines
431 B
Python
14 lines
431 B
Python
'''
|
|
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())
|
|
print(sum([e for e in range(3, n) if e % 3 == 0 or e % 5 == 0]))
|