| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | ||||
| 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| 25 | 26 | 27 | 28 | 29 | 30 | 31 |
- Laminar
- 예제
- 프로젝트오일러
- programmers
- 통계학
- python3
- Fluids
- 우선순위큐
- Python
- Turbulent
- Crank-Nicolson
- Boundary Layers
- 회귀
- Fluid Dynamics
- 디스크 컨트롤러
- Compressible Flow
- 유체역학
- Finite Difference Method
- 프로그래머스
- Heat Equation
- Statistics
- FTCS
- heap
- regression
- 힙
- 이중우선순위큐
- projecteuler
- Navier-Stokes
- Blasius
- 파이썬
- Today
- Total
Sudal's Garage
Project Euler 8 본문
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?
문제:
다음 1000자리 수에서 인접한 4개의 수의 곱 중 가장 큰 것은 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
그렇다면 주어진 1000자리 수에서 인접한 13개의 숫자의 곱 중 가장 큰 곱의 값은?
Solution:
1 2 3 4 5 6 7 | number = 73167176531330624919225119674... numst = list(str(number)) result = 0 for x in range(len(numst)): if eval('*'.join(numst[x:x + 13])) > result: result = eval('*'.join(numst[x:x + 13])) print(result) | cs |
number 에 그냥 숫자를 붙였다.. 귀찮아서
리스트로 만들고 , 13개의 숫자 사이사이에 * 붙여서 eval 함수로 계산을 했다
eval 은 파이썬 내장함수로, 실행가능한 문자열은 실행시켜준다.
'Programming > Project Euler - python' 카테고리의 다른 글
| Project Euler 10 (0) | 2019.02.16 |
|---|---|
| Project Euler 9 (0) | 2019.02.06 |
| Project Euler 6 (0) | 2019.01.30 |
| Project Euler 5 (0) | 2019.01.30 |
| Project Euler 4 (0) | 2019.01.30 |