Project Euler #1: Sum of Multiples of 3 and 5 below 1000 Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Project Euler problem 1 in Python - Multiples of 3 and 5Finding the sum of all the multiples of 3 or 5 below 1000, using list comprehensionProject Euler 1 (sum of multiples of 3 or 5 under 1000)Project Euler 38: Pandigital MultiplesProject Euler #1 Sum of all the multiples of 3 or 5 below 1000Project Euler 25 - 1000-digit Fibonacci NumberProject Euler Problem 52: Permuted multiplesProject Euler #1 Sum of multiples of 3 and 5Sum of all multiples of 3 or 5 below 1000 (Project Euler #1 - typical)Sum of multiples of 3 or 5 using functional programmingAdd multiples of 3 or 5 below 1000, Can this code be optimised. Project Euler #1

Trying to understand entropy as a novice in thermodynamics

newbie Q : How to read an output file in one command line

Weaponising the Grasp-at-a-Distance spell

Centre cell vertically in tabularx

How to make triangles with rounded sides and corners? (squircle with 3 sides)

Why complex landing gears are used instead of simple, reliable and light weight muscle wire or shape memory alloys?

Can gravitational waves pass through a black hole?

Determine whether an integer is a palindrome

Fit odd number of triplets in a measure?

"Destructive power" carried by a B-52?

Can two people see the same photon?

Why not use the yoke to control yaw, as well as pitch and roll?

What are some likely causes to domain member PC losing contact to domain controller?

When to apply negative sign when number is squared

Why weren't discrete x86 CPUs ever used in game hardware?

Flight departed from the gate 5 min before scheduled departure time. Refund options

Are there any irrational/transcendental numbers for which the distribution of decimal digits is not uniform?

What does 丫 mean? 丫是什么意思?

Is this Half dragon Quaggoth Balanced

Twin's vs. Twins'

In musical terms, what properties are varied by the human voice to produce different words / syllables?

New Order #6: Easter Egg

How does TikZ render an arc?

Order between one to one functions and their inverses



Project Euler #1: Sum of Multiples of 3 and 5 below 1000



Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Project Euler problem 1 in Python - Multiples of 3 and 5Finding the sum of all the multiples of 3 or 5 below 1000, using list comprehensionProject Euler 1 (sum of multiples of 3 or 5 under 1000)Project Euler 38: Pandigital MultiplesProject Euler #1 Sum of all the multiples of 3 or 5 below 1000Project Euler 25 - 1000-digit Fibonacci NumberProject Euler Problem 52: Permuted multiplesProject Euler #1 Sum of multiples of 3 and 5Sum of all multiples of 3 or 5 below 1000 (Project Euler #1 - typical)Sum of multiples of 3 or 5 using functional programmingAdd multiples of 3 or 5 below 1000, Can this code be optimised. Project Euler #1



.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








3












$begingroup$


def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.










share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00

















3












$begingroup$


def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.










share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00













3












3








3





$begingroup$


def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.










share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.







python performance python-3.x programming-challenge






share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited Apr 18 at 6:15







DjVasu













New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Apr 17 at 4:20









DjVasuDjVasu

163




163




New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00
















  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00















$begingroup$
To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
$endgroup$
– Roland Illig
Apr 17 at 6:05




$begingroup$
To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
$endgroup$
– Roland Illig
Apr 17 at 6:05












$begingroup$
I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
$endgroup$
– Roland Illig
Apr 17 at 6:18




$begingroup$
I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
$endgroup$
– Roland Illig
Apr 17 at 6:18




2




2




$begingroup$
Is i % 35 really the condition you would like to check?
$endgroup$
– Alex
Apr 17 at 7:00




$begingroup$
Is i % 35 really the condition you would like to check?
$endgroup$
– Alex
Apr 17 at 7:00










1 Answer
1






active

oldest

votes


















8












$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$












  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17











Your Answer






StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);






DjVasu is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217598%2fproject-euler-1-sum-of-multiples-of-3-and-5-below-1000%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









8












$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$












  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17















8












$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$












  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17













8












8








8





$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$



I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.







share|improve this answer














share|improve this answer



share|improve this answer








edited Apr 17 at 13:29

























answered Apr 17 at 5:05









AJNeufeldAJNeufeld

7,1391723




7,1391723











  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17
















  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17















$begingroup$
You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
$endgroup$
– Bailey Parker
Apr 17 at 21:00




$begingroup$
You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
$endgroup$
– Bailey Parker
Apr 17 at 21:00












$begingroup$
Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
$endgroup$
– Sigur
Apr 17 at 23:21





$begingroup$
Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
$endgroup$
– Sigur
Apr 17 at 23:21













$begingroup$
@Sigur yeah you can take two sets and apply union also.
$endgroup$
– DjVasu
Apr 18 at 6:17




$begingroup$
@Sigur yeah you can take two sets and apply union also.
$endgroup$
– DjVasu
Apr 18 at 6:17










DjVasu is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















DjVasu is a new contributor. Be nice, and check out our Code of Conduct.












DjVasu is a new contributor. Be nice, and check out our Code of Conduct.











DjVasu is a new contributor. Be nice, and check out our Code of Conduct.














Thanks for contributing an answer to Code Review Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217598%2fproject-euler-1-sum-of-multiples-of-3-and-5-below-1000%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Bulk add to cart function issuecart vs. mini cart issue … rwd themeRedirect Add to cart button to cart pageAdd to cart issue - Magento 2.1The requested Payment Method is not available When creating an orderM2: reason add-to-cart might not function in production modeAdd to cart issue in some android devicesMagento 2 - custom price can not add to subtotal and grand total after add to cartAdd to cart codeIssue with my cart module on pdp and cart pages, just keeps spinningBulk price and quantity update using rest api

БиармияSxpst500bh2ntaf! 3h2r