Francisco Javier Coutiño / Project Euler cpp

Download as
Browse Code »

Commit da9921201cc6f84e938b7d92fd763ab3dfd1a8d2

Authored by Francisco Javier Coutiño
1 parent 20676b739a
Exists in master

p11 - Resuelto

Showing 2 changed files with 63 additions and 8 deletions   Show diff stats
11 - Mayor producto en cuadricula/p11
Diff comments   View file @da99212
No preview for this file type
11 - Mayor producto en cuadricula/p11.cpp
Diff comments   View file @da99212
1 /* 1 /*
2 Largest product in a grid 2 Largest product in a grid
3 Problem 11 3 Problem 11
4 4
5 In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 5 In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
6 6
7 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 7 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
8 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 8 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
9 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 9 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
10 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 10 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
11 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 11 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
12 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 12 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
13 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 13 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
14 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 14 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
15 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 15 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
16 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 16 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
17 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 17 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
18 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 18 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
19 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
20 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 20 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
21 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 21 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
22 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 22 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
23 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36 23 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
24 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16 24 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
25 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 25 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
26 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48 26 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
27 27
28 The product of these numbers is 26 × 63 × 78 × 14 = 1788696. 28 The product of these numbers is 26 × 63 × 78 × 14 = 1788696.
29 29
30 What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid? 30 What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?
31 31
32 */ 32 */
33 #include <stdio.h> 33 #include <stdio.h>
34 #include <stdlib.h> 34 #include <stdlib.h>
35 #include <string.h> 35 #include <string.h>
36 36
37 using namespace std; 37 using namespace std;
38 38
39 #define SIZE_X 20 39 #define SIZE_X 20
40 #define SIZE_Y 20 40 #define SIZE_Y 20
41 #define SIZE_MAX_NUMBER 2 41 #define SIZE_MAX_NUMBER 2
42 42
43 int multiplyHorRight(int x, int y, int grid[SIZE_X][SIZE_Y]);
44 int multiplyVerDown(int x, int y, int grid[SIZE_X][SIZE_Y]);
45 int multiplyDiagRight(int x, int y, int grid[SIZE_X][SIZE_Y]);
46 int multiplyDiagLeft(int x, int y, int grid[SIZE_X][SIZE_Y]);
47
48 int maxValue(int a, int b);
49
43 int main(int argc, char const *argv[]) 50 int main(int argc, char const *argv[])
44 { 51 {
45 int x; 52 int x;
46 int y; 53 int y;
47 int grid[SIZE_X][SIZE_Y] = {0}; 54 int grid[SIZE_X][SIZE_Y] = {0};
48 55
56 long resultMax = 0;
57
49 char buffer[SIZE_MAX_NUMBER]; 58 char buffer[SIZE_MAX_NUMBER];
50 char *ptrBuffer; 59 char *ptrBuffer;
51 char *ptrNumeros; 60 char *ptrNumeros;
52 char numeros[] = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08\n49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00\n81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65\n52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91\n22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80\n24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50\n32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70\n67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21\n24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72\n21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95\n78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92\n16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57\n86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58\n19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40\n04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66\n88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69\n04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36\n20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16\n20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54\n01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48\n\0"; 61 char numeros[] = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08\n49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00\n81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65\n52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91\n22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80\n24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50\n32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70\n67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21\n24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72\n21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95\n78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92\n16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57\n86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58\n19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40\n04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66\n88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69\n04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36\n20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16\n20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54\n01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48\n\0";
53 62
54 x = y = 0; 63 x = y = 0;
55 ptrBuffer = buffer; 64 ptrBuffer = buffer;
56 ptrNumeros = numeros; 65 ptrNumeros = numeros;
57 while(*ptrNumeros != '\0') 66 while(*ptrNumeros != '\0')
58 { 67 {
59 if (*ptrNumeros == ' ' || *ptrNumeros == '\n') 68 if (*ptrNumeros == ' ' || *ptrNumeros == '\n')
60 { 69 {
61 grid[x][y] = atoi(buffer); 70 grid[x][y] = atoi(buffer);
62 71
63 if (*ptrNumeros == ' ') 72 if (*ptrNumeros == ' ')
64 { 73 {
65 x++; 74 x++;
66 } 75 }
67 else 76 else
68 { 77 {
69 x = 0; 78 x = 0;
70 y++; 79 y++;
71 } 80 }
72 81
73 ptrBuffer = buffer; 82 ptrBuffer = buffer;
74 memset(buffer,'\0',SIZE_MAX_NUMBER); 83 memset(buffer,'\0',SIZE_MAX_NUMBER);
75
76 } 84 }
77 else { *ptrBuffer++ = *ptrNumeros; } 85 else { *ptrBuffer++ = *ptrNumeros; }
78 86
79 ptrNumeros++; 87 ptrNumeros++;
80 } 88 }
81 89
82 //________________________________________- 90 //------------------------------------------
83 //PRINT GRID 91 resultMax = 0;
84 for (int i = 0; i < SIZE_Y; ++i) 92 for (y = 0; y < SIZE_Y; ++y)
85 { 93 {
86 for (int j = 0; j < SIZE_X; ++j) 94 for (x = 0; x < SIZE_X; ++x)
87 { 95 {
88 printf("%d\t",grid[j][i]); 96 resultMax = maxValue(multiplyHorRight(y, x, grid), resultMax); //Validacion de Horizontal
97 resultMax = maxValue(multiplyVerDown(y, x, grid), resultMax); //Validacion de Vertical
98 resultMax = maxValue(multiplyDiagRight(y, x, grid), resultMax); //Validacion en Diagonal derecha
99 resultMax = maxValue(multiplyDiagLeft(y, x, grid), resultMax); //Validacion en Diagonal izquierda
89 } 100 }
90 printf("\n");
91 } 101 }
92 //------------------------------------------
93 102
103 printf("Resultado:\t%ld\n", resultMax);
94 104
95 return 0; 105 return 0;
106 }
107
108
109 //HORIZOTAL
110 int multiplyHorRight(int x, int y, int grid[SIZE_X][SIZE_Y])
111 {
112 return ( x+3 < SIZE_X ) ?
113 grid[x][y] *
114 grid[x+1][y] *
115 grid[x+2][y] *
116 grid[x+3][y] : 0;
117 }
118
119 //VERTICAL
120 int multiplyVerDown(int x, int y, int grid[SIZE_X][SIZE_Y])
121 {
122 return ( y+3 < SIZE_Y ) ?
123 grid[x][y] *
124 grid[x][y+1] *
125 grid[x][y+2] *
126 grid[x][y+3] : 0;
127 }
128
129 //DIAGONAL
130 int multiplyDiagRight(int x, int y, int grid[SIZE_X][SIZE_Y])
131 {
132 return ( x+3 < SIZE_X && y+3 < SIZE_Y ) ?
133 grid[x][y] *
134 grid[x+1][y+1] *
135 grid[x+2][y+2] *
136 grid[x+3][y+3] : 0;
137 }
138
139 int multiplyDiagLeft(int x, int y, int grid[SIZE_X][SIZE_Y])
140 {
141 return ( x-3 >= 0 && y+3 < SIZE_Y ) ?
142 grid[x][y] *
143 grid[x-1][y+1] *
144 grid[x-2][y+2] *
145 grid[x-3][y+3] : 0;
146 }
147
148 int maxValue(int a, int b)