Greatest product in Grid (due 22 Apr 2017)

This assignment is a variation of a problem from Project Euler. You are required to find the greatest product of four adjacent numbers in the same direction (horizontal, vertical, or diagonal) in a grid of positive integers.

You will read your input from the file grid.txt . The first line indicates n the dimension of the grid. The dimension of the grid will be much larger than 4. This will be followed by n lines of data. Each line of data will have n positive integers.

You will have a single line of output:

The greatest product is 70600674.

For this assignment you may work with a partner. Both of you will have to read the paper on Pair Programming . The two of you will jointly work on this assignment and submit a single copy of the assignment with both your names on it.

The file that you will be turning in will be called We will be looking at good documentation and adherence to the coding convention discussed in class. Your file will have a header of the following form:

#  File:

#  Description:

#  Student Name:

#  Student UT EID:

#  Partner Name:

#  Partner UT EID:

#  Course Name: CS 303E

#  Unique Number: 

#  Date Created:

#  Date Last Modified:

Use the Canvas program to submit your file. We should receive your work by 11 PM on Saturday, 22 Apr 2017. There will be substantial penalties if you do not adhere to the guidelines.