Project Euler #1: Sum of Multiples of 3 and 5 below 1000 Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30 pm 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
Writing a T-SQL stored procedure to receive 4 numbers and insert them into a table
How to begin with a paragraph in latex
When speaking, how do you change your mind mid-sentence?
What *exactly* is electrical current, voltage, and resistance?
What does the black goddess statue do and what is it?
How was Lagrange appointed professor of mathematics so early?
How do I deal with an erroneously large refund?
What is ls Largest Number Formed by only moving two sticks in 508?
What is the purpose of the side handle on a hand ("eggbeater") drill?
Like totally amazing interchangeable sister outfit accessory swapping or whatever
How can I wire a 9-position switch so that each position turns on one more LED than the one before?
How to keep bees out of canned beverages?
Raising a bilingual kid. When should we introduce the majority language?
Will I lose my paid in full property
How to compute a Jacobian using polar coordinates?
What's called a person who works as someone who puts products on shelves in stores?
Is there a way to fake a method response using Mock or Stubs?
/bin/ls sorts differently than just ls
false 'Security alert' from Google - every login generates mails from 'no-reply@accounts.google.com'
France's Public Holidays' Puzzle
How to translate "red flag" into Spanish?
Determinant of a matrix with 2 equal rows
Does using the Inspiration rules for character defects encourage My Guy Syndrome?
Why is water being consumed when my shutoff valve is closed?
Project Euler #1: Sum of Multiples of 3 and 5 below 1000
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30 pm 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;
$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.
python performance python-3.x programming-challenge
New contributor
$endgroup$
add a comment |
$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.
python performance python-3.x programming-challenge
New contributor
$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$
Isi % 35
really the condition you would like to check?
$endgroup$
– Alex
Apr 17 at 7:00
add a comment |
$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.
python performance python-3.x programming-challenge
New contributor
$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
python performance python-3.x programming-challenge
New contributor
New contributor
edited Apr 18 at 6:15
DjVasu
New contributor
asked Apr 17 at 4:20
DjVasuDjVasu
163
163
New contributor
New contributor
$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$
Isi % 35
really the condition you would like to check?
$endgroup$
– Alex
Apr 17 at 7:00
add a comment |
$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$
Isi % 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
add a comment |
1 Answer
1
active
oldest
votes
$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.
$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 beand
instead ofor
, I think. OP wants multiple of 3 and 5. So,3,6,9,12,15,...
intersects5,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
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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.
$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 beand
instead ofor
, I think. OP wants multiple of 3 and 5. So,3,6,9,12,15,...
intersects5,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
add a comment |
$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.
$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 beand
instead ofor
, I think. OP wants multiple of 3 and 5. So,3,6,9,12,15,...
intersects5,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
add a comment |
$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.
$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.
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 beand
instead ofor
, I think. OP wants multiple of 3 and 5. So,3,6,9,12,15,...
intersects5,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
add a comment |
$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 beand
instead ofor
, I think. OP wants multiple of 3 and 5. So,3,6,9,12,15,...
intersects5,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
add a comment |
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.
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$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