"num = tuple(int(d) for d in \"7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450\")"
]
},
{
"cell_type": "markdown",
"id": "8b53af56",
"metadata": {},
"source": [
"Now we'll just do a sliding window over the number to find the thirteen adjacent digits with the greatest product."
]
},
{
"cell_type": "code",
"execution_count": 2,
"id": "6b760673",
"metadata": {},
"outputs": [
{
"data": {
"text/plain": [
"(5, 5, 7, 6, 6, 8, 9, 6, 6, 4, 8, 9, 5)"
]
},
"execution_count": 2,
"metadata": {},
"output_type": "execute_result"
}
],
"source": [
"subnums = (num[i:i+13] for i in range(0, len(num)-13))\n",
"This work is licensed under the [Creative Commons Attribution-ShareAlike 4.0 International license](https://creativecommons.org/licenses/by-sa/4.0/) and the [BSD Zero Clause license](https://spdx.org/licenses/0BSD.html)."