diagonales

1RECORRER DIAGONALES
2
3La prinicpal no
4	|	0|	1	|	2	|	3	|	4	|	5|
50|_P_|__*_|__*|_*_|_*_|_*|
61|___|_P__|__*|__*|_*_|_*|
72|___|____|_P_|_*_|_*_|*_|
83|___|____|___|P_|_*_|_*_|
94|___|____|___|___|_P_|*_|
104|___|____|___|___|___|P_|
11
12
13			d1				d2				d3				d4				d5
14		(0, 1)		(0, 2)		(0, 3)		(0, 4)		(0, 5)
15		(1, 2)		(1, 3)		(1, 4)		(1, 5)
16		(2, 3)		(2, 4)		(2, 5)
17		(3, 4)		(3, 5)
18		(4, 5)
19
20		(i, j)
21
22#define kDIM 6
23typedef int TMatriz[kDIM][kDIM]; //es cuadrada
24
25void imprimir_diagonales(TMatriz m){
26	int d, i, j, suma;
27
28	for(d = 1; d < kDIM; d++){
29		i = 0;
30		j = d;
31		suma = 0;
32		while(j < kDIM){
33			suma = suma + m[i][j];
34			i++;
35			j++;
36		}
37		printf("%d\n", suma);
38	}
39}
40
41//si no fuera cuadrada:
42void imprimir_diagonales(TMatriz m){
43	int d, i, j, suma;
44
45	for(d = 1; d < columnas; d++){
46		i = 0;
47		j = d;
48		suma = 0;
49		while(i < filas && j < columnas){
50			suma = suma + m[i][j];
51			i++;
52			j++;
53		}
54		printf("%d\n", suma);
55	}
56}
57
58
59
60
61	|	0|	1	|	2	|	3	|	4	|	5|
620|_*_|__*_|_*_|_*_|_*_|*_|
631|__*|_*__|__*|__*|_*_|__|
642|_*_|__*_|_*_|_*_|___|__|
653|_*_|_*__|_*_|___|___|__|
664|__*|__*_|___|___|___|__|
675|_*_|____|___|___|__|___|
68
69
70	d0				d1				d2				d3				d4				d5
71(0, 0)		(1, 0)		(2, 0)		(3, 0)		(4, 0)		(5, 0)
72					(0, 1)		(1, 1)		(2, 1)		(3, 1)		(4, 1)
73										(0, 2)		(1, 2)		(2, 2)		(3, 2)
74															(0, 3)		(1, 3)		(2, 3)
75																				(0, 4)		(1, 4)
76																									(0, 5)
77
78																									(i, j)
79      
80      void sumamayor(TMatriz m){
81  int d, i, j;
82  int suma = 0;
83
84  for(d = 0; d < kDIM; d++){
85  	suma = 0;
86  	for(i = d, j = 0; i >= 0; i--, j++){
87  		suma = suma + m[i][j];
88
89  	}
90      printf("suma: %d\n ", suma);
91  }
92
93}
94
95//recorrer todas las diagonales a partir de la esquina inferior izquierda
96std::vector<int> diagonal(const TMatrix& a){
97	int d, i, j;
98	std::vector<int> res;
99	int filas, columnas;
100	int suma;
101
102	filas = a.size();
103	columnas = a[0].size();
104
105//1ª parte:
106	for(d = filas - 1; d >= 0; d--){
107		i = d;
108		j = 0;
109		suma = 0;
110		while(i < filas && j < columnas){
111			suma = suma + a[i][j];
112			i++;
113			j++;
114		}
115		res.push_back(suma);
116	}
117//2ª parte:
118	for(d = 0; d < columnas; d++){
119		i = 0;
120		j = d;
121		suma = 0;
122		while(i < filas && j < columnas){
123			suma = suma + a[i][j];
124			i++;
125			j++;
126		}
127		res.push_back(suma);
128	}
129	return res;
130}