Project Euler Problem 8 - Largest product in a seriesNumber of maximal PAIRS-valuesProject Euler Problem 11:...
Modulo 2 binary long division in European notation
apt-get update is failing in debian
when is out of tune ok?
Is there any reason not to eat food that's been dropped on the surface of the moon?
Why are on-board computers allowed to change controls without notifying the pilots?
Lay out the Carpet
Is a roofing delivery truck likely to crack my driveway slab?
How does it work when somebody invests in my business?
Applicability of Single Responsibility Principle
Finding all intervals that match predicate in vector
How do I rename a LINUX host without needing to reboot for the rename to take effect?
how to analyze "是其于主也至忠矣"
Cynical novel that describes an America ruled by the media, arms manufacturers, and ethnic figureheads
How can I replace every global instance of "x[2]" with "x_2"
Best way to store options for panels
Have I saved too much for retirement so far?
Should my PhD thesis be submitted under my legal name?
Are there any thematic similarities between Shostakovichs' Symphony 5th and Beethovens' 7th symphony?
Can I Retrieve Email Addresses from BCC?
quarter to five p.m
The Riley Riddle Mine
Greatest common substring
Where in the Bible does the greeting ("Dominus Vobiscum") used at Mass come from?
voltage of sounds of mp3files
Project Euler Problem 8 - Largest product in a series
Number of maximal PAIRS-valuesProject Euler Problem 11: largest product of 4 adjacent numbersPython IBAN validationProject Euler 11: Largest product in a grid, Python3Solution to Google Code Jam 2008 round 1C problem BGeneral unit tested solution to Project Euler Problem 8: Largest product in a seriesChecking if the whole number is prime, and if all its digits are tooPython Find the N adjacent digits in the 1000-digit number that have the greatest productSearch father (x) of the number D(x) and measure time and memory consumedProject Euler 378: Count ordered triplets whose triangular numbers have decreasing number of factors
$begingroup$
I am new to python3 and tried to solve the task in a very basic way. Please critique my code. I appriciate any suggestions for improvement.
Here is the question:
The four adjacent digits in the 1000-digit number that have the
greatest product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have
the greatest product. What is the value of this product?
My Code:
s = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
listem = []
listem2 = []
highest = 1
pp = 13
sonuc = 1
for i in range(1001 - pp + 1):
listem.append(s[i: i+pp])
for digit in listem[i]:
listem2.append(digit)
listem2 = [int(k) for k in listem2]
for q in listem2:
sonuc *= q
if highest < sonuc:
highest = sonuc
sonuc = 1
listem2 = []
print(highest)
python beginner python-3.x programming-challenge
edited 8 mins ago
Alex
856316
asked 1 hour ago
Güray SurGüray Sur
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I am new to python3 and tried to solve the task in a very basic way. Please critique my code. I appriciate any suggestions for improvement.
Here is the question:
The four adjacent digits in the 1000-digit number that have the
greatest product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have
the greatest product. What is the value of this product?
My Code:
s = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
listem = []
listem2 = []
highest = 1
pp = 13
sonuc = 1
for i in range(1001 - pp + 1):
listem.append(s[i: i+pp])
for digit in listem[i]:
listem2.append(digit)
listem2 = [int(k) for k in listem2]
for q in listem2:
sonuc *= q
if highest < sonuc:
highest = sonuc
sonuc = 1
listem2 = []
print(highest)
python beginner python-3.x programming-challenge
edited 8 mins ago
Alex
856316
asked 1 hour ago
Güray SurGüray Sur
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I am new to python3 and tried to solve the task in a very basic way. Please critique my code. I appriciate any suggestions for improvement.
Here is the question:
The four adjacent digits in the 1000-digit number that have the
greatest product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have
the greatest product. What is the value of this product?
My Code:
s = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
listem = []
listem2 = []
highest = 1
pp = 13
sonuc = 1
for i in range(1001 - pp + 1):
listem.append(s[i: i+pp])
for digit in listem[i]:
listem2.append(digit)
listem2 = [int(k) for k in listem2]
for q in listem2:
sonuc *= q
if highest < sonuc:
highest = sonuc
sonuc = 1
listem2 = []
print(highest)
python beginner python-3.x programming-challenge
edited 8 mins ago
Alex
856316
asked 1 hour ago
Güray SurGüray Sur
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I am new to python3 and tried to solve the task in a very basic way. Please critique my code. I appriciate any suggestions for improvement.
Here is the question:
The four adjacent digits in the 1000-digit number that have the
greatest product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have
the greatest product. What is the value of this product?
My Code:
s = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
listem = []
listem2 = []
highest = 1
pp = 13
sonuc = 1
for i in range(1001 - pp + 1):
listem.append(s[i: i+pp])
for digit in listem[i]:
listem2.append(digit)
listem2 = [int(k) for k in listem2]
for q in listem2:
sonuc *= q
if highest < sonuc:
highest = sonuc
sonuc = 1
listem2 = []
print(highest)
python beginner python-3.x programming-challenge
python beginner python-3.x programming-challenge
edited 8 mins ago
Alex
856316
asked 1 hour ago
Güray SurGüray Sur
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 8 mins ago
Alex
856316
asked 1 hour ago
Güray SurGüray Sur
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 8 mins ago
Alex
856316
edited 8 mins ago
Alex
856316
edited 8 mins ago
Alex
856316
856316
asked 1 hour ago
Güray SurGüray Sur
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 1 hour ago
Güray SurGüray Sur
62
asked 1 hour ago
Güray SurGüray Sur
62
62
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Güray Sur is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
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
});
}
});
Güray Sur 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%2f216289%2fproject-euler-problem-8-largest-product-in-a-series%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Güray Sur is a new contributor. Be nice, and check out our Code of Conduct.
Güray Sur is a new contributor. Be nice, and check out our Code of Conduct.
Güray Sur is a new contributor. Be nice, and check out our Code of Conduct.
Güray Sur 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%2f216289%2fproject-euler-problem-8-largest-product-in-a-series%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
