Data hosted with ♥ by Pastebin.com - Download Raw - See Original
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. /* Remember 2d arrays are declared array[rows][columns] */
  5.  
  6. /* I'm recycling code for looping through 2d arrays. The tests for
  7.    breaking out of the loop when there aren't four in a row or diagonal
  8.    left are in if statements. The other way would have been simply artificially
  9.    shorten the for loops. Six of one... */
  10.  
  11. #define NROW 20 /* Number of rows */
  12. #define NCOL 20 /* Number of columns */
  13.  
  14. int PE11Array[NROW][NCOL] = {
  15.     {8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8},
  16.     {49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 04, 56, 62, 00},
  17.     {81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 03, 49, 13, 36, 65},
  18.     {52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 01, 32, 56, 71, 37, 02, 36, 91},
  19.     {22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80},
  20.     {24, 47, 32, 60, 99, 3, 45, 02, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50},
  21.     {32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70},
  22.     {67, 26, 20, 68, 02, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21},
  23.     {24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72},
  24.     {21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95},
  25.     {78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92},
  26.     {16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57},
  27.     {86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58},
  28.     {19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40},
  29.     {4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66},
  30.     {88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69},
  31.     {4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36},
  32.     {20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16},
  33.     {20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54},
  34.     {1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48}
  35.                             };
  36.  
  37.  
  38. int main()
  39. {
  40.     int temp = 0;
  41.     int largest = 0;
  42.     int row,col;
  43.     /* Step 1 is to find all the products of four numbers in a row horizontally*/
  44.     printf("Starting Horizontal Row Test\n");
  45.     for (row = 0; row <= (NROW - 1); row++)
  46.         {
  47.             for (col = 0; col <= NCOL - 1; col++)
  48.                 {
  49.                     /* if there aren't four left in the row, break */
  50.                     if ((col + 3) > (NCOL - 1))
  51.                         {
  52.                             printf("Next line\n");
  53.                             break;
  54.                         }
  55.                     else
  56.                         {
  57.                             temp = ((PE11Array[row][col]) * (PE11Array[row][col+1]) * (PE11Array[row][col+2]) * (PE11Array[row][col+3]));
  58.                             if (temp > largest)
  59.                                 {
  60.                                     largest = temp;
  61.                                 }
  62.                             printf("%i * %i * %i * %i = %i\nLargest is %i\n", (PE11Array[row][col]), (PE11Array[row][col+1]), (PE11Array[row][col+2]), (PE11Array[row][col+3]), temp, largest);
  63.                             //getchar();
  64.                         }
  65.                 }
  66.         }
  67.  
  68.     /* Step 2 is to find all the products of four numbers in a row vertically */
  69.     printf("Starting Vertical Row Test\n");
  70.     for (row = 0; row <= (NROW - 1); row++)
  71.         {
  72.             if ((row + 3) > (NROW - 1))
  73.                 {
  74.                     printf("Next line\n");
  75.                     break;
  76.                 }
  77.             for (col = 0; col <= NCOL - 1; col++)
  78.                 {
  79.                     /* if there aren't four left in the row, break */
  80.                     temp = ((PE11Array[row][col]) * (PE11Array[row+1][col]) * (PE11Array[row+2][col]) * (PE11Array[row+3][col]));
  81.                     if (temp > largest)
  82.                         {
  83.                             largest = temp;
  84.                         }
  85.                     printf("%i * %i * %i * %i = %i\nLargest is %i\n", (PE11Array[row][col]), (PE11Array[row+1][col]), (PE11Array[row+2][col]), (PE11Array[row+3][col]), temp, largest);
  86.                     //getchar();
  87.                 }
  88.  
  89.         }
  90.  
  91.     printf("Starting Diagonal to the Lower Right Test\n");
  92.     for (row = 0; row <= (NROW - 1); row++)
  93.         {
  94.             if ((row + 3) > (NROW - 1))
  95.                 {
  96.                     printf("Next line\n");
  97.                     break;
  98.                 }
  99.             for (col = 0; col <= NCOL - 1; col++)
  100.                 {
  101.                     /* if there aren't four left in the row, break */
  102.                     if ((col + 3) > (NCOL - 1))
  103.                         {
  104.                             printf("Next line\n");
  105.                             break;
  106.                         }
  107.                     else
  108.                         {
  109.                             temp = ((PE11Array[row][col]) * (PE11Array[row+1][col+1]) * (PE11Array[row+2][col+2]) * (PE11Array[row+3][col+3]));
  110.                             if (temp > largest)
  111.                                 {
  112.                                     largest = temp;
  113.                                 }
  114.                             printf("%i * %i * %i * %i = %i\nLargest is %i\n", (PE11Array[row][col]), (PE11Array[row+1][col+1]), (PE11Array[row+2][col+2]), (PE11Array[row+3][col+3]), temp, largest);
  115.                             //getchar();
  116.                         }
  117.                 }
  118.         }
  119.  
  120.     printf("Starting Diagonal to the Lower Left Test\n");
  121.     for (row = 0; row <= (NROW - 1); row++)
  122.         {
  123.             if ((row + 3) > (NROW - 1))
  124.                 {
  125.                     printf("Next line\n");
  126.                     break;
  127.                 }
  128.             for (col = 0; col <= NCOL - 1; col++)
  129.                 {
  130.                     /* if there aren't four left in the row, break */
  131.                     if ((col - 3) < 0)
  132.                         {
  133.                             printf("Next line\n");
  134.                             //break;
  135.                         }
  136.                     else
  137.                         {
  138.                             temp = ((PE11Array[row][col]) * (PE11Array[row+1][col-1]) * (PE11Array[row+2][col-2]) * (PE11Array[row+3][col-3]));
  139.                             if (temp > largest)
  140.                                 {
  141.                                     largest = temp;
  142.                                 }
  143.                             printf("%i * %i * %i * %i = %i\nLargest is %i\n", (PE11Array[row][col]), (PE11Array[row+1][col-1]), (PE11Array[row+2][col-2]), (PE11Array[row+3][col-3]), temp, largest);
  144.                             //getchar();
  145.                         }
  146.                 }
  147.         }
  148.  
  149.     return 0;
  150. }