GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — EulerProjectScripts/Problem 11.py at master · setc/EulerProjectScripts

Expand file tree

/

Problem 11.py

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
21 lines (19 loc) · 754 Bytes
/

Problem 11.py

Copy path

File metadata and controls

21 lines (19 loc) · 754 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#-------------------------------------------------------------------------------
# Name: Problem 11
# Purpose: What is the greatest product of four adjacent numbers in any
# direction (up, down, left, right, or diagonally) in the 2020 grid?
#
# Author: Sebastián Torrente
#
# Created: 13/11/2012
# Comment: Interesting. Given that I'm using Python 3.2 I don't have the
# the useful matrix from Numpy at hand.
#-------------------------------------------------------------------------------
def readmatrix(file):
"""
Take a file with a matrix of numbers and return a nested list with the elements.
"""
pass
if __name__ == '__main__':
data = open(r'Data\data11.txt')
print(data)
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.