Scribd
Upload
8 views3 pages

Davaleba 16 2

The document contains code snippets for 4 problems involving 2D arrays. The code takes in 2D arrays as input, performs various operations like dividing elements, checking for equality or increasing order, and outputs results.

Uploaded by

LUKA SHVELIDZE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
8 views3 pages

Davaleba 16 2

The document contains code snippets for 4 problems involving 2D arrays. The code takes in 2D arrays as input, performs various operations like dividing elements, checking for equality or increasing order, and outputs results.

Uploaded by

LUKA SHVELIDZE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

//davaleba N1

//#include <iostream>
//using namespace std;
//
//int main()
//{
// int n;
// cin>>n;
// int a[n][n];
// for(int i = 0; i < n; i++){
// for(int k = 0; k < n; k++){
// cin>>a[i][k];
// }
// }
// for(int i = 0; i < n; i++){
// for(int k = 0; k < n; k++){
// if(i == k){
// a[i][k] /= 2;
// }
// }
// }
// for(int i = 0; i < n; i++){
// a[i][n-i-1] /= 2;
// }
// if(n % 2 == 1){
// a[n/2][n/2] *= 2;
// }
// for(int i = 0; i < n; i++){
// for(int k = 0; k < n; k++){
// cout<<a[i][k]<<"";
// }
// cout<<endl;
// }
//}

//davaleba N2

//#include <iostream>
//using namespace std;
//
//int main()
//{
// int n,m;
// cin>>m>>n;
// int a[n[m];
// bool ans=true;
// for(int i = 0; i < n; i++){
// for(int k = 0; k < n; k++){
// cin>>a[i][k];
// }
// }
// for(int i = 0; i < n; i++){
// for(int k = 0; k < m; k++){
// for(int i1 = 0; i1 < n; i1++){
// for(int k1 = 0; k1 < m; k1++){
// if(a[i][k] == a[i1][k1]){
// ans = false;
// }
// }
// }
// }
// }
// if(ans == true){
// cout<<"same"<<endl;
// }else{
// cout<<"not same"<<endl;
// }
//}

//davaleba N3

//#include <iostream>
//using namespace std;
//
//int main() {
//
// int n,m;
// cin>>n>>m;
// int a[n][m];
// int zrdadia = 0;
// bool increasing = true;
// for (int i = 0; i < n; i++){
// for (int k = 0; k < m; k++){
// cin>>a[i][k];
// }
// }
// for (int i = 0; i < n; ++i){
// for (int k = 1; k < m; ++k){
// if (a[i][j] <= a[i][j - 1]){
// tuara = false;
// break;
// }
// }
// if (tuari) {
// zrdadia++;
// }
// }
// cout<<zrdaida<<endl;
//}

// davaleba N4

//#include <iostream>
//using namespace std;
//
//int main()
//{
// int n;
// cin>>n;
// int a[n][n];
// bool pas = true;
// for(int i = 0; i < n; i++){
// for(int k = 0; k < n; k++){
// cin>>a[i][k];
// }
// }
// for(int i = 0; i < n; i++){
// for(int k = 0; k < n; k++){
// if(a[i][k] != a[k][i]){
// pas = false;
// }
// }
// }
// cout<<pas<<endl;
//}

You might also like