Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<cstdlib>
- #include <ctime>
- int main()
- {
- srand(time(NULL));
- const int N = 6;
- int tab[N][N] ;
- for ( int w = 0; w < N; w++)
- {
- for( int k = 0; k < N; k++)
- {
- tab[w][k] = rand ();
- }
- }
- for ( int w = 0; w < N; w++)
- {
- for( int k = 0; k < N; k++)
- {
- std:: cout << tab[w][k] << '\t';
- }
- std:: cout << std:: endl;
- }
- int a = tab[0][0];
- int b = tab[1][1];
- int a_i = 0, a_j = 0, b_i = 1, b_j = 1;
- if(b > a)
- {
- std:: swap (a, b);
- std::swap(a_i, b_i);
- std::swap(a_j, b_j);
- }
- for(int i = 0; i < N; ++i)
- for(int j = 0; j < N; ++j)
- {
- if(i == j || i == N - j - 1)
- {
- // sprawdzamy czy dany element jest większy od dotychczas największego:
- if(tab[i][j] > a)
- {
- b = a;
- b_i = a_i;
- b_j = a_j;
- a = tab[i][j];
- a_i = i;
- a_j = j;
- }
- // sprawdzamy czy dany element jest większy od dotychczas drugiego największego:
- else if(tab[i][j] > b)
- {
- b = tab[i][j];
- b_i = i;
- b_j = j;
- }
- }
- }
- int c = tab[0][0];
- int c_i = 0;
- int c_j = 0;
- int d = tab[0][1];
- int d_i = 0;
- int d_j = 1;
- if(d < c)
- {
- std::swap(c, d);
- std::swap(c_i, d_i);
- std::swap(c_j, d_j);
- }
- for (int i = 0; i < N; i++ )
- {
- for(int j = 0; j < N; j++)
- {
- if(( i > 0 && i < N - 1) && (j > 0 && j < N -1))
- continue;
- if(tab[i][j] < c)
- {
- d = c;
- d_i = c_i;
- d_j = c_j;
- c = tab[i][j];
- c_i = i;
- c_j = j;
- }
- else if(tab[i][j] < d)
- {
- d = tab[i][j];
- d_i = i;
- d_j = j;
- }
- }
- }
- std:: cout << std::endl << "Najwieksze wartosci na przekatnych wynosza " << a << " oraz " << b << std::endl;
- tab[a_i][a_j] = 0;
- tab[b_i][b_j] = 0;
- std::cout << std::endl;
- std:: cout << "Najmniejsza liczba na obwodzie to:" << c ;
- std:: cout << std::endl;
- std:: cout << "Druga Najmniejsza liczba na obwodzie to:" << d ;
- std:: cout << std::endl << std::endl;
- tab[c_i][c_j] = c + d;
- tab[d_i][d_j] = c + d;
- for ( int w = 0; w < N; w++)
- {
- for( int k = 0; k < N; k++)
- {
- std:: cout << tab[w][k] << '\t';
- }
- std:: cout << std:: endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement